/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix015_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:32:08,588 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:32:08,593 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:32:08,609 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:32:08,609 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:32:08,611 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:32:08,613 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:32:08,622 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:32:08,624 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:32:08,626 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:32:08,628 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:32:08,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:32:08,629 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:32:08,631 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:32:08,633 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:32:08,635 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:32:08,636 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:32:08,639 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:32:08,640 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:32:08,645 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:32:08,648 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:32:08,649 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:32:08,650 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:32:08,651 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:32:08,655 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:32:08,656 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:32:08,656 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:32:08,657 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:32:08,658 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:32:08,659 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:32:08,659 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:32:08,660 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:32:08,661 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:32:08,661 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:32:08,663 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:32:08,663 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:32:08,664 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:32:08,664 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:32:08,664 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:32:08,668 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:32:08,669 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:32:08,670 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:32:08,687 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:32:08,688 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:32:08,689 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:32:08,690 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:32:08,690 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:32:08,690 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:32:08,690 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:32:08,690 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:32:08,691 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:32:08,691 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:32:08,692 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:32:08,692 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:32:08,692 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:32:08,693 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:32:08,693 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:32:08,693 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:32:08,693 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:32:08,693 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:32:08,694 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:32:08,694 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:32:08,694 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:32:08,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:32:08,694 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:32:08,694 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:32:08,695 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:32:08,695 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:32:08,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:32:08,695 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:32:08,695 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:32:08,695 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:32:08,983 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:32:09,007 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:32:09,011 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:32:09,012 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:32:09,013 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:32:09,014 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix015_pso.oepc.i [2019-12-18 12:32:09,083 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b204a4c2e/397721df811a43c085355d49e2ae01d0/FLAG388f17ee4 [2019-12-18 12:32:09,587 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:32:09,588 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015_pso.oepc.i [2019-12-18 12:32:09,613 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b204a4c2e/397721df811a43c085355d49e2ae01d0/FLAG388f17ee4 [2019-12-18 12:32:09,918 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b204a4c2e/397721df811a43c085355d49e2ae01d0 [2019-12-18 12:32:09,928 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:32:09,931 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:32:09,932 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:32:09,932 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:32:09,935 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:32:09,936 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:32:09" (1/1) ... [2019-12-18 12:32:09,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75cc43a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:32:09, skipping insertion in model container [2019-12-18 12:32:09,940 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:32:09" (1/1) ... [2019-12-18 12:32:09,948 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:32:10,016 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:32:10,562 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:32:10,580 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:32:10,707 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:32:10,797 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:32:10,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:32:10 WrapperNode [2019-12-18 12:32:10,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:32:10,799 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:32:10,799 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:32:10,799 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:32:10,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:32:10" (1/1) ... [2019-12-18 12:32:10,830 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:32:10" (1/1) ... [2019-12-18 12:32:10,863 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:32:10,868 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:32:10,868 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:32:10,868 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:32:10,878 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:32:10" (1/1) ... [2019-12-18 12:32:10,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:32:10" (1/1) ... [2019-12-18 12:32:10,893 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:32:10" (1/1) ... [2019-12-18 12:32:10,893 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:32:10" (1/1) ... [2019-12-18 12:32:10,909 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:32:10" (1/1) ... [2019-12-18 12:32:10,915 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:32:10" (1/1) ... [2019-12-18 12:32:10,923 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:32:10" (1/1) ... [2019-12-18 12:32:10,932 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:32:10,933 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:32:10,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:32:10,933 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:32:10,934 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:32:10" (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 12:32:10,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:32:10,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:32:10,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:32:10,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:32:10,995 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:32:10,995 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:32:10,995 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:32:10,996 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:32:10,996 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:32:10,996 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:32:10,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:32:10,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:32:10,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:32:10,999 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 12:32:11,853 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:32:11,853 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:32:11,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:32:11 BoogieIcfgContainer [2019-12-18 12:32:11,855 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:32:11,856 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:32:11,857 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:32:11,860 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:32:11,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:32:09" (1/3) ... [2019-12-18 12:32:11,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50740821 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:32:11, skipping insertion in model container [2019-12-18 12:32:11,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:32:10" (2/3) ... [2019-12-18 12:32:11,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50740821 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:32:11, skipping insertion in model container [2019-12-18 12:32:11,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:32:11" (3/3) ... [2019-12-18 12:32:11,865 INFO L109 eAbstractionObserver]: Analyzing ICFG mix015_pso.oepc.i [2019-12-18 12:32:11,876 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:32:11,877 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:32:11,888 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:32:11,889 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:32:11,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,958 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,959 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,959 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,960 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,960 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,967 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,967 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,974 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,975 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:11,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,003 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,005 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,014 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,015 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,015 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,018 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,019 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:32:12,040 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:32:12,061 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:32:12,061 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:32:12,062 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:32:12,062 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:32:12,062 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:32:12,062 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:32:12,062 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:32:12,062 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:32:12,086 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-18 12:32:12,088 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-18 12:32:12,228 INFO L126 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-18 12:32:12,228 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:32:12,253 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 9/173 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:32:12,281 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-18 12:32:12,337 INFO L126 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-18 12:32:12,338 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:32:12,346 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 9/173 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:32:12,369 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 12:32:12,370 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:32:17,440 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-18 12:32:17,580 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-18 12:32:17,724 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80759 [2019-12-18 12:32:17,724 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-18 12:32:17,728 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 102 transitions [2019-12-18 12:32:36,278 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 118022 states. [2019-12-18 12:32:36,280 INFO L276 IsEmpty]: Start isEmpty. Operand 118022 states. [2019-12-18 12:32:36,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:32:36,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:32:36,286 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:32:36,286 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:32:36,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:32:36,291 INFO L82 PathProgramCache]: Analyzing trace with hash 922782, now seen corresponding path program 1 times [2019-12-18 12:32:36,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:32:36,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917731431] [2019-12-18 12:32:36,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:32:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:32:36,614 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 12:32:36,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917731431] [2019-12-18 12:32:36,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:32:36,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:32:36,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562086481] [2019-12-18 12:32:36,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:32:36,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:32:36,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:32:36,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:32:36,639 INFO L87 Difference]: Start difference. First operand 118022 states. Second operand 3 states. [2019-12-18 12:32:40,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:32:40,414 INFO L93 Difference]: Finished difference Result 116858 states and 495582 transitions. [2019-12-18 12:32:40,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:32:40,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:32:40,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:32:41,232 INFO L225 Difference]: With dead ends: 116858 [2019-12-18 12:32:41,233 INFO L226 Difference]: Without dead ends: 110138 [2019-12-18 12:32:41,234 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 12:32:46,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110138 states. [2019-12-18 12:32:50,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110138 to 110138. [2019-12-18 12:32:50,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110138 states. [2019-12-18 12:32:50,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110138 states to 110138 states and 466462 transitions. [2019-12-18 12:32:50,828 INFO L78 Accepts]: Start accepts. Automaton has 110138 states and 466462 transitions. Word has length 3 [2019-12-18 12:32:50,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:32:50,829 INFO L462 AbstractCegarLoop]: Abstraction has 110138 states and 466462 transitions. [2019-12-18 12:32:50,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:32:50,829 INFO L276 IsEmpty]: Start isEmpty. Operand 110138 states and 466462 transitions. [2019-12-18 12:32:50,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:32:50,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:32:50,833 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:32:50,834 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:32:50,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:32:50,834 INFO L82 PathProgramCache]: Analyzing trace with hash 228105342, now seen corresponding path program 1 times [2019-12-18 12:32:50,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:32:50,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394994549] [2019-12-18 12:32:50,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:32:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:32:50,918 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 12:32:50,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394994549] [2019-12-18 12:32:50,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:32:50,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:32:50,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602722950] [2019-12-18 12:32:50,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:32:50,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:32:50,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:32:50,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:32:50,921 INFO L87 Difference]: Start difference. First operand 110138 states and 466462 transitions. Second operand 4 states. [2019-12-18 12:32:55,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:32:55,781 INFO L93 Difference]: Finished difference Result 170904 states and 695583 transitions. [2019-12-18 12:32:55,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:32:55,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:32:55,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:32:56,657 INFO L225 Difference]: With dead ends: 170904 [2019-12-18 12:32:56,658 INFO L226 Difference]: Without dead ends: 170855 [2019-12-18 12:32:56,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:33:02,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170855 states. [2019-12-18 12:33:06,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170855 to 156295. [2019-12-18 12:33:06,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156295 states. [2019-12-18 12:33:14,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156295 states to 156295 states and 644009 transitions. [2019-12-18 12:33:14,291 INFO L78 Accepts]: Start accepts. Automaton has 156295 states and 644009 transitions. Word has length 11 [2019-12-18 12:33:14,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:14,291 INFO L462 AbstractCegarLoop]: Abstraction has 156295 states and 644009 transitions. [2019-12-18 12:33:14,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:33:14,292 INFO L276 IsEmpty]: Start isEmpty. Operand 156295 states and 644009 transitions. [2019-12-18 12:33:14,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:33:14,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:14,299 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:33:14,299 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:33:14,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:14,300 INFO L82 PathProgramCache]: Analyzing trace with hash 891607686, now seen corresponding path program 1 times [2019-12-18 12:33:14,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:14,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805879917] [2019-12-18 12:33:14,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:14,374 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 12:33:14,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805879917] [2019-12-18 12:33:14,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:14,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:33:14,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314714092] [2019-12-18 12:33:14,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:33:14,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:14,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:33:14,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:33:14,376 INFO L87 Difference]: Start difference. First operand 156295 states and 644009 transitions. Second operand 3 states. [2019-12-18 12:33:14,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:14,532 INFO L93 Difference]: Finished difference Result 33673 states and 108735 transitions. [2019-12-18 12:33:14,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:33:14,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 12:33:14,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:14,592 INFO L225 Difference]: With dead ends: 33673 [2019-12-18 12:33:14,592 INFO L226 Difference]: Without dead ends: 33673 [2019-12-18 12:33:14,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:33:14,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33673 states. [2019-12-18 12:33:15,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33673 to 33673. [2019-12-18 12:33:15,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33673 states. [2019-12-18 12:33:15,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33673 states to 33673 states and 108735 transitions. [2019-12-18 12:33:15,209 INFO L78 Accepts]: Start accepts. Automaton has 33673 states and 108735 transitions. Word has length 13 [2019-12-18 12:33:15,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:15,209 INFO L462 AbstractCegarLoop]: Abstraction has 33673 states and 108735 transitions. [2019-12-18 12:33:15,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:33:15,210 INFO L276 IsEmpty]: Start isEmpty. Operand 33673 states and 108735 transitions. [2019-12-18 12:33:15,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:33:15,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:15,212 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:33:15,213 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:33:15,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:15,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1993825600, now seen corresponding path program 1 times [2019-12-18 12:33:15,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:15,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888919744] [2019-12-18 12:33:15,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:15,292 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 12:33:15,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888919744] [2019-12-18 12:33:15,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:15,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:33:15,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717075324] [2019-12-18 12:33:15,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:33:15,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:15,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:33:15,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:33:15,294 INFO L87 Difference]: Start difference. First operand 33673 states and 108735 transitions. Second operand 4 states. [2019-12-18 12:33:15,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:15,676 INFO L93 Difference]: Finished difference Result 42056 states and 135369 transitions. [2019-12-18 12:33:15,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:33:15,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:33:15,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:15,746 INFO L225 Difference]: With dead ends: 42056 [2019-12-18 12:33:15,746 INFO L226 Difference]: Without dead ends: 42056 [2019-12-18 12:33:15,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:33:18,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42056 states. [2019-12-18 12:33:18,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42056 to 37770. [2019-12-18 12:33:18,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37770 states. [2019-12-18 12:33:18,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37770 states to 37770 states and 121950 transitions. [2019-12-18 12:33:18,811 INFO L78 Accepts]: Start accepts. Automaton has 37770 states and 121950 transitions. Word has length 16 [2019-12-18 12:33:18,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:18,812 INFO L462 AbstractCegarLoop]: Abstraction has 37770 states and 121950 transitions. [2019-12-18 12:33:18,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:33:18,813 INFO L276 IsEmpty]: Start isEmpty. Operand 37770 states and 121950 transitions. [2019-12-18 12:33:18,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:33:18,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:18,821 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:33:18,822 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:33:18,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:18,822 INFO L82 PathProgramCache]: Analyzing trace with hash 674854723, now seen corresponding path program 1 times [2019-12-18 12:33:18,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:18,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442946075] [2019-12-18 12:33:18,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:18,938 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 12:33:18,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442946075] [2019-12-18 12:33:18,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:18,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:33:18,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096538268] [2019-12-18 12:33:18,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:33:18,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:18,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:33:18,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:33:18,940 INFO L87 Difference]: Start difference. First operand 37770 states and 121950 transitions. Second operand 5 states. [2019-12-18 12:33:19,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:19,544 INFO L93 Difference]: Finished difference Result 48537 states and 154193 transitions. [2019-12-18 12:33:19,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:33:19,544 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:33:19,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:19,627 INFO L225 Difference]: With dead ends: 48537 [2019-12-18 12:33:19,627 INFO L226 Difference]: Without dead ends: 48530 [2019-12-18 12:33:19,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:33:19,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48530 states. [2019-12-18 12:33:20,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48530 to 37459. [2019-12-18 12:33:20,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37459 states. [2019-12-18 12:33:20,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37459 states to 37459 states and 120776 transitions. [2019-12-18 12:33:20,654 INFO L78 Accepts]: Start accepts. Automaton has 37459 states and 120776 transitions. Word has length 22 [2019-12-18 12:33:20,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:20,654 INFO L462 AbstractCegarLoop]: Abstraction has 37459 states and 120776 transitions. [2019-12-18 12:33:20,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:33:20,655 INFO L276 IsEmpty]: Start isEmpty. Operand 37459 states and 120776 transitions. [2019-12-18 12:33:20,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:33:20,667 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:20,667 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:33:20,667 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:33:20,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:20,667 INFO L82 PathProgramCache]: Analyzing trace with hash 332765886, now seen corresponding path program 1 times [2019-12-18 12:33:20,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:20,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120310331] [2019-12-18 12:33:20,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:20,721 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 12:33:20,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120310331] [2019-12-18 12:33:20,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:20,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:33:20,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194824168] [2019-12-18 12:33:20,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:33:20,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:20,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:33:20,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:33:20,724 INFO L87 Difference]: Start difference. First operand 37459 states and 120776 transitions. Second operand 4 states. [2019-12-18 12:33:20,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:20,793 INFO L93 Difference]: Finished difference Result 14576 states and 44297 transitions. [2019-12-18 12:33:20,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:33:20,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 12:33:20,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:20,813 INFO L225 Difference]: With dead ends: 14576 [2019-12-18 12:33:20,814 INFO L226 Difference]: Without dead ends: 14576 [2019-12-18 12:33:20,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 12:33:20,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14576 states. [2019-12-18 12:33:21,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14576 to 14332. [2019-12-18 12:33:21,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14332 states. [2019-12-18 12:33:21,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14332 states to 14332 states and 43601 transitions. [2019-12-18 12:33:21,031 INFO L78 Accepts]: Start accepts. Automaton has 14332 states and 43601 transitions. Word has length 25 [2019-12-18 12:33:21,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:21,032 INFO L462 AbstractCegarLoop]: Abstraction has 14332 states and 43601 transitions. [2019-12-18 12:33:21,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:33:21,032 INFO L276 IsEmpty]: Start isEmpty. Operand 14332 states and 43601 transitions. [2019-12-18 12:33:21,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:33:21,043 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:21,043 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:33:21,043 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:33:21,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:21,044 INFO L82 PathProgramCache]: Analyzing trace with hash 445555351, now seen corresponding path program 1 times [2019-12-18 12:33:21,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:21,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140080943] [2019-12-18 12:33:21,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:21,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:21,090 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 12:33:21,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140080943] [2019-12-18 12:33:21,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:21,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:33:21,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668720342] [2019-12-18 12:33:21,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:33:21,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:21,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:33:21,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:33:21,093 INFO L87 Difference]: Start difference. First operand 14332 states and 43601 transitions. Second operand 3 states. [2019-12-18 12:33:21,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:21,215 INFO L93 Difference]: Finished difference Result 22367 states and 67484 transitions. [2019-12-18 12:33:21,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:33:21,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 12:33:21,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:21,257 INFO L225 Difference]: With dead ends: 22367 [2019-12-18 12:33:21,258 INFO L226 Difference]: Without dead ends: 22367 [2019-12-18 12:33:21,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:33:21,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22367 states. [2019-12-18 12:33:21,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22367 to 16938. [2019-12-18 12:33:21,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16938 states. [2019-12-18 12:33:21,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16938 states to 16938 states and 51830 transitions. [2019-12-18 12:33:21,553 INFO L78 Accepts]: Start accepts. Automaton has 16938 states and 51830 transitions. Word has length 27 [2019-12-18 12:33:21,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:21,553 INFO L462 AbstractCegarLoop]: Abstraction has 16938 states and 51830 transitions. [2019-12-18 12:33:21,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:33:21,553 INFO L276 IsEmpty]: Start isEmpty. Operand 16938 states and 51830 transitions. [2019-12-18 12:33:21,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:33:21,565 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:21,565 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:33:21,565 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:33:21,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:21,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1217095067, now seen corresponding path program 1 times [2019-12-18 12:33:21,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:21,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484256492] [2019-12-18 12:33:21,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:21,631 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 12:33:21,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484256492] [2019-12-18 12:33:21,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:21,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:33:21,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445476228] [2019-12-18 12:33:21,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:33:21,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:21,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:33:21,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:33:21,633 INFO L87 Difference]: Start difference. First operand 16938 states and 51830 transitions. Second operand 3 states. [2019-12-18 12:33:21,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:21,736 INFO L93 Difference]: Finished difference Result 22367 states and 66493 transitions. [2019-12-18 12:33:21,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:33:21,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 12:33:21,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:21,766 INFO L225 Difference]: With dead ends: 22367 [2019-12-18 12:33:21,766 INFO L226 Difference]: Without dead ends: 22367 [2019-12-18 12:33:21,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:33:21,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22367 states. [2019-12-18 12:33:22,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22367 to 16938. [2019-12-18 12:33:22,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16938 states. [2019-12-18 12:33:22,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16938 states to 16938 states and 50839 transitions. [2019-12-18 12:33:22,297 INFO L78 Accepts]: Start accepts. Automaton has 16938 states and 50839 transitions. Word has length 27 [2019-12-18 12:33:22,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:22,297 INFO L462 AbstractCegarLoop]: Abstraction has 16938 states and 50839 transitions. [2019-12-18 12:33:22,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:33:22,297 INFO L276 IsEmpty]: Start isEmpty. Operand 16938 states and 50839 transitions. [2019-12-18 12:33:22,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:33:22,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:22,313 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:33:22,313 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:33:22,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:22,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1361870049, now seen corresponding path program 1 times [2019-12-18 12:33:22,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:22,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737312399] [2019-12-18 12:33:22,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:22,430 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 12:33:22,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737312399] [2019-12-18 12:33:22,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:22,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:33:22,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491281434] [2019-12-18 12:33:22,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:33:22,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:22,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:33:22,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:33:22,434 INFO L87 Difference]: Start difference. First operand 16938 states and 50839 transitions. Second operand 6 states. [2019-12-18 12:33:23,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:23,044 INFO L93 Difference]: Finished difference Result 31275 states and 92943 transitions. [2019-12-18 12:33:23,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:33:23,045 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 12:33:23,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:23,095 INFO L225 Difference]: With dead ends: 31275 [2019-12-18 12:33:23,095 INFO L226 Difference]: Without dead ends: 31275 [2019-12-18 12:33:23,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:33:23,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31275 states. [2019-12-18 12:33:23,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31275 to 19607. [2019-12-18 12:33:23,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19607 states. [2019-12-18 12:33:23,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19607 states to 19607 states and 58673 transitions. [2019-12-18 12:33:23,474 INFO L78 Accepts]: Start accepts. Automaton has 19607 states and 58673 transitions. Word has length 27 [2019-12-18 12:33:23,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:23,474 INFO L462 AbstractCegarLoop]: Abstraction has 19607 states and 58673 transitions. [2019-12-18 12:33:23,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:33:23,474 INFO L276 IsEmpty]: Start isEmpty. Operand 19607 states and 58673 transitions. [2019-12-18 12:33:23,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 12:33:23,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:23,489 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:33:23,489 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:33:23,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:23,489 INFO L82 PathProgramCache]: Analyzing trace with hash -2015671980, now seen corresponding path program 1 times [2019-12-18 12:33:23,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:23,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207232547] [2019-12-18 12:33:23,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:23,633 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 12:33:23,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207232547] [2019-12-18 12:33:23,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:23,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:33:23,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093207449] [2019-12-18 12:33:23,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:33:23,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:23,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:33:23,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:33:23,635 INFO L87 Difference]: Start difference. First operand 19607 states and 58673 transitions. Second operand 6 states. [2019-12-18 12:33:24,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:24,252 INFO L93 Difference]: Finished difference Result 30618 states and 90299 transitions. [2019-12-18 12:33:24,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:33:24,253 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-18 12:33:24,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:24,295 INFO L225 Difference]: With dead ends: 30618 [2019-12-18 12:33:24,296 INFO L226 Difference]: Without dead ends: 30618 [2019-12-18 12:33:24,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:33:24,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30618 states. [2019-12-18 12:33:24,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30618 to 19271. [2019-12-18 12:33:24,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19271 states. [2019-12-18 12:33:25,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19271 states to 19271 states and 57577 transitions. [2019-12-18 12:33:25,013 INFO L78 Accepts]: Start accepts. Automaton has 19271 states and 57577 transitions. Word has length 28 [2019-12-18 12:33:25,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:25,013 INFO L462 AbstractCegarLoop]: Abstraction has 19271 states and 57577 transitions. [2019-12-18 12:33:25,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:33:25,013 INFO L276 IsEmpty]: Start isEmpty. Operand 19271 states and 57577 transitions. [2019-12-18 12:33:25,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:33:25,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:25,033 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:33:25,033 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:33:25,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:25,034 INFO L82 PathProgramCache]: Analyzing trace with hash 405285854, now seen corresponding path program 1 times [2019-12-18 12:33:25,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:25,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199519578] [2019-12-18 12:33:25,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:25,094 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 12:33:25,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199519578] [2019-12-18 12:33:25,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:25,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:33:25,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557590602] [2019-12-18 12:33:25,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:33:25,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:25,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:33:25,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:33:25,097 INFO L87 Difference]: Start difference. First operand 19271 states and 57577 transitions. Second operand 5 states. [2019-12-18 12:33:25,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:25,443 INFO L93 Difference]: Finished difference Result 23829 states and 70169 transitions. [2019-12-18 12:33:25,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:33:25,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-18 12:33:25,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:25,475 INFO L225 Difference]: With dead ends: 23829 [2019-12-18 12:33:25,476 INFO L226 Difference]: Without dead ends: 23829 [2019-12-18 12:33:25,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:33:25,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23829 states. [2019-12-18 12:33:25,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23829 to 20047. [2019-12-18 12:33:25,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20047 states. [2019-12-18 12:33:25,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20047 states to 20047 states and 59899 transitions. [2019-12-18 12:33:25,793 INFO L78 Accepts]: Start accepts. Automaton has 20047 states and 59899 transitions. Word has length 33 [2019-12-18 12:33:25,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:25,794 INFO L462 AbstractCegarLoop]: Abstraction has 20047 states and 59899 transitions. [2019-12-18 12:33:25,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:33:25,794 INFO L276 IsEmpty]: Start isEmpty. Operand 20047 states and 59899 transitions. [2019-12-18 12:33:25,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:33:25,816 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:25,816 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:33:25,816 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:33:25,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:25,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1258895234, now seen corresponding path program 2 times [2019-12-18 12:33:25,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:25,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839477422] [2019-12-18 12:33:25,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:25,914 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 12:33:25,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839477422] [2019-12-18 12:33:25,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:25,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:33:25,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667874609] [2019-12-18 12:33:25,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:33:25,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:25,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:33:25,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:33:25,916 INFO L87 Difference]: Start difference. First operand 20047 states and 59899 transitions. Second operand 7 states. [2019-12-18 12:33:27,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:27,174 INFO L93 Difference]: Finished difference Result 39715 states and 116920 transitions. [2019-12-18 12:33:27,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:33:27,175 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 12:33:27,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:27,252 INFO L225 Difference]: With dead ends: 39715 [2019-12-18 12:33:27,253 INFO L226 Difference]: Without dead ends: 39715 [2019-12-18 12:33:27,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-18 12:33:27,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39715 states. [2019-12-18 12:33:27,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39715 to 21295. [2019-12-18 12:33:27,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21295 states. [2019-12-18 12:33:27,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21295 states to 21295 states and 63643 transitions. [2019-12-18 12:33:27,690 INFO L78 Accepts]: Start accepts. Automaton has 21295 states and 63643 transitions. Word has length 33 [2019-12-18 12:33:27,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:27,690 INFO L462 AbstractCegarLoop]: Abstraction has 21295 states and 63643 transitions. [2019-12-18 12:33:27,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:33:27,690 INFO L276 IsEmpty]: Start isEmpty. Operand 21295 states and 63643 transitions. [2019-12-18 12:33:27,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:33:27,707 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:27,707 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:33:27,708 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:33:27,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:27,708 INFO L82 PathProgramCache]: Analyzing trace with hash -454706214, now seen corresponding path program 3 times [2019-12-18 12:33:27,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:27,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939730548] [2019-12-18 12:33:27,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:27,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:27,854 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 12:33:27,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939730548] [2019-12-18 12:33:27,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:27,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:33:27,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000933996] [2019-12-18 12:33:27,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:33:27,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:27,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:33:27,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:33:27,856 INFO L87 Difference]: Start difference. First operand 21295 states and 63643 transitions. Second operand 8 states. [2019-12-18 12:33:28,469 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-12-18 12:33:29,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:29,834 INFO L93 Difference]: Finished difference Result 46968 states and 136953 transitions. [2019-12-18 12:33:29,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 12:33:29,834 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-18 12:33:29,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:29,900 INFO L225 Difference]: With dead ends: 46968 [2019-12-18 12:33:29,900 INFO L226 Difference]: Without dead ends: 46968 [2019-12-18 12:33:29,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:33:30,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46968 states. [2019-12-18 12:33:30,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46968 to 20735. [2019-12-18 12:33:30,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20735 states. [2019-12-18 12:33:30,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20735 states to 20735 states and 61975 transitions. [2019-12-18 12:33:30,391 INFO L78 Accepts]: Start accepts. Automaton has 20735 states and 61975 transitions. Word has length 33 [2019-12-18 12:33:30,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:30,391 INFO L462 AbstractCegarLoop]: Abstraction has 20735 states and 61975 transitions. [2019-12-18 12:33:30,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:33:30,391 INFO L276 IsEmpty]: Start isEmpty. Operand 20735 states and 61975 transitions. [2019-12-18 12:33:30,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 12:33:30,410 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:30,411 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:33:30,411 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:33:30,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:30,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1655017129, now seen corresponding path program 1 times [2019-12-18 12:33:30,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:30,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431258495] [2019-12-18 12:33:30,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:30,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:33:30,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431258495] [2019-12-18 12:33:30,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:30,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:33:30,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220717500] [2019-12-18 12:33:30,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:33:30,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:30,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:33:30,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:33:30,503 INFO L87 Difference]: Start difference. First operand 20735 states and 61975 transitions. Second operand 7 states. [2019-12-18 12:33:31,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:31,772 INFO L93 Difference]: Finished difference Result 36504 states and 106979 transitions. [2019-12-18 12:33:31,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:33:31,772 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-18 12:33:31,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:31,828 INFO L225 Difference]: With dead ends: 36504 [2019-12-18 12:33:31,828 INFO L226 Difference]: Without dead ends: 36504 [2019-12-18 12:33:31,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-18 12:33:31,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36504 states. [2019-12-18 12:33:32,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36504 to 19450. [2019-12-18 12:33:32,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19450 states. [2019-12-18 12:33:32,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19450 states to 19450 states and 58223 transitions. [2019-12-18 12:33:32,541 INFO L78 Accepts]: Start accepts. Automaton has 19450 states and 58223 transitions. Word has length 34 [2019-12-18 12:33:32,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:32,542 INFO L462 AbstractCegarLoop]: Abstraction has 19450 states and 58223 transitions. [2019-12-18 12:33:32,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:33:32,542 INFO L276 IsEmpty]: Start isEmpty. Operand 19450 states and 58223 transitions. [2019-12-18 12:33:32,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 12:33:32,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:32,559 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:33:32,560 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:33:32,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:32,560 INFO L82 PathProgramCache]: Analyzing trace with hash 2107636055, now seen corresponding path program 2 times [2019-12-18 12:33:32,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:32,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586209268] [2019-12-18 12:33:32,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:32,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:32,646 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 12:33:32,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586209268] [2019-12-18 12:33:32,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:32,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:33:32,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397066800] [2019-12-18 12:33:32,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:33:32,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:32,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:33:32,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:33:32,648 INFO L87 Difference]: Start difference. First operand 19450 states and 58223 transitions. Second operand 8 states. [2019-12-18 12:33:34,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:34,237 INFO L93 Difference]: Finished difference Result 41529 states and 120361 transitions. [2019-12-18 12:33:34,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 12:33:34,241 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-18 12:33:34,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:34,315 INFO L225 Difference]: With dead ends: 41529 [2019-12-18 12:33:34,315 INFO L226 Difference]: Without dead ends: 41529 [2019-12-18 12:33:34,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:33:34,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41529 states. [2019-12-18 12:33:34,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41529 to 17750. [2019-12-18 12:33:34,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17750 states. [2019-12-18 12:33:34,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17750 states to 17750 states and 53183 transitions. [2019-12-18 12:33:34,729 INFO L78 Accepts]: Start accepts. Automaton has 17750 states and 53183 transitions. Word has length 34 [2019-12-18 12:33:34,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:34,730 INFO L462 AbstractCegarLoop]: Abstraction has 17750 states and 53183 transitions. [2019-12-18 12:33:34,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:33:34,730 INFO L276 IsEmpty]: Start isEmpty. Operand 17750 states and 53183 transitions. [2019-12-18 12:33:34,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:33:34,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:34,753 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:33:34,753 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:33:34,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:34,753 INFO L82 PathProgramCache]: Analyzing trace with hash -887512480, now seen corresponding path program 1 times [2019-12-18 12:33:34,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:34,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915738147] [2019-12-18 12:33:34,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:34,808 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 12:33:34,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915738147] [2019-12-18 12:33:34,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:34,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:33:34,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765142919] [2019-12-18 12:33:34,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:33:34,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:34,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:33:34,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:33:34,810 INFO L87 Difference]: Start difference. First operand 17750 states and 53183 transitions. Second operand 4 states. [2019-12-18 12:33:34,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:34,934 INFO L93 Difference]: Finished difference Result 30219 states and 90879 transitions. [2019-12-18 12:33:34,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:33:34,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-18 12:33:34,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:34,962 INFO L225 Difference]: With dead ends: 30219 [2019-12-18 12:33:34,963 INFO L226 Difference]: Without dead ends: 15274 [2019-12-18 12:33:34,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:33:35,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15274 states. [2019-12-18 12:33:35,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15274 to 15208. [2019-12-18 12:33:35,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15208 states. [2019-12-18 12:33:35,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15208 states to 15208 states and 44774 transitions. [2019-12-18 12:33:35,202 INFO L78 Accepts]: Start accepts. Automaton has 15208 states and 44774 transitions. Word has length 39 [2019-12-18 12:33:35,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:35,202 INFO L462 AbstractCegarLoop]: Abstraction has 15208 states and 44774 transitions. [2019-12-18 12:33:35,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:33:35,203 INFO L276 IsEmpty]: Start isEmpty. Operand 15208 states and 44774 transitions. [2019-12-18 12:33:35,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:33:35,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:35,218 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:33:35,218 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:33:35,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:35,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1585510358, now seen corresponding path program 2 times [2019-12-18 12:33:35,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:35,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843076641] [2019-12-18 12:33:35,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:35,263 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 12:33:35,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843076641] [2019-12-18 12:33:35,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:35,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:33:35,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812071016] [2019-12-18 12:33:35,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:33:35,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:35,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:33:35,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:33:35,265 INFO L87 Difference]: Start difference. First operand 15208 states and 44774 transitions. Second operand 3 states. [2019-12-18 12:33:35,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:35,312 INFO L93 Difference]: Finished difference Result 15207 states and 44772 transitions. [2019-12-18 12:33:35,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:33:35,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 12:33:35,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:35,335 INFO L225 Difference]: With dead ends: 15207 [2019-12-18 12:33:35,336 INFO L226 Difference]: Without dead ends: 15207 [2019-12-18 12:33:35,336 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 12:33:35,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15207 states. [2019-12-18 12:33:35,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15207 to 15207. [2019-12-18 12:33:35,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15207 states. [2019-12-18 12:33:35,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15207 states to 15207 states and 44772 transitions. [2019-12-18 12:33:35,874 INFO L78 Accepts]: Start accepts. Automaton has 15207 states and 44772 transitions. Word has length 39 [2019-12-18 12:33:35,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:35,874 INFO L462 AbstractCegarLoop]: Abstraction has 15207 states and 44772 transitions. [2019-12-18 12:33:35,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:33:35,874 INFO L276 IsEmpty]: Start isEmpty. Operand 15207 states and 44772 transitions. [2019-12-18 12:33:35,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:33:35,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:35,890 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:33:35,890 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:33:35,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:35,890 INFO L82 PathProgramCache]: Analyzing trace with hash -408863373, now seen corresponding path program 1 times [2019-12-18 12:33:35,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:35,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054410607] [2019-12-18 12:33:35,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:35,940 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 12:33:35,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054410607] [2019-12-18 12:33:35,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:35,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:33:35,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214645974] [2019-12-18 12:33:35,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:33:35,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:35,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:33:35,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:33:35,942 INFO L87 Difference]: Start difference. First operand 15207 states and 44772 transitions. Second operand 4 states. [2019-12-18 12:33:36,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:36,058 INFO L93 Difference]: Finished difference Result 24324 states and 71986 transitions. [2019-12-18 12:33:36,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:33:36,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-18 12:33:36,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:36,083 INFO L225 Difference]: With dead ends: 24324 [2019-12-18 12:33:36,084 INFO L226 Difference]: Without dead ends: 11139 [2019-12-18 12:33:36,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:33:36,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11139 states. [2019-12-18 12:33:36,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11139 to 11082. [2019-12-18 12:33:36,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11082 states. [2019-12-18 12:33:36,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11082 states to 11082 states and 31786 transitions. [2019-12-18 12:33:36,337 INFO L78 Accepts]: Start accepts. Automaton has 11082 states and 31786 transitions. Word has length 40 [2019-12-18 12:33:36,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:36,337 INFO L462 AbstractCegarLoop]: Abstraction has 11082 states and 31786 transitions. [2019-12-18 12:33:36,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:33:36,338 INFO L276 IsEmpty]: Start isEmpty. Operand 11082 states and 31786 transitions. [2019-12-18 12:33:36,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:33:36,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:36,353 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:33:36,353 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:33:36,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:36,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1542545665, now seen corresponding path program 2 times [2019-12-18 12:33:36,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:36,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653298521] [2019-12-18 12:33:36,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:36,466 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 12:33:36,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653298521] [2019-12-18 12:33:36,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:36,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:33:36,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456706063] [2019-12-18 12:33:36,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:33:36,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:36,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:33:36,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:33:36,468 INFO L87 Difference]: Start difference. First operand 11082 states and 31786 transitions. Second operand 3 states. [2019-12-18 12:33:36,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:36,530 INFO L93 Difference]: Finished difference Result 11010 states and 31559 transitions. [2019-12-18 12:33:36,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:33:36,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 12:33:36,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:36,556 INFO L225 Difference]: With dead ends: 11010 [2019-12-18 12:33:36,556 INFO L226 Difference]: Without dead ends: 11010 [2019-12-18 12:33:36,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 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 12:33:36,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11010 states. [2019-12-18 12:33:36,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11010 to 10774. [2019-12-18 12:33:36,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10774 states. [2019-12-18 12:33:36,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10774 states to 10774 states and 31128 transitions. [2019-12-18 12:33:36,845 INFO L78 Accepts]: Start accepts. Automaton has 10774 states and 31128 transitions. Word has length 40 [2019-12-18 12:33:36,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:36,845 INFO L462 AbstractCegarLoop]: Abstraction has 10774 states and 31128 transitions. [2019-12-18 12:33:36,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:33:36,845 INFO L276 IsEmpty]: Start isEmpty. Operand 10774 states and 31128 transitions. [2019-12-18 12:33:36,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 12:33:36,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:36,862 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:33:36,863 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:33:36,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:36,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1254097199, now seen corresponding path program 1 times [2019-12-18 12:33:36,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:36,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700618810] [2019-12-18 12:33:36,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:36,939 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 12:33:36,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700618810] [2019-12-18 12:33:36,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:36,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:33:36,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108030420] [2019-12-18 12:33:36,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:33:36,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:36,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:33:36,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:33:36,941 INFO L87 Difference]: Start difference. First operand 10774 states and 31128 transitions. Second operand 5 states. [2019-12-18 12:33:37,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:37,001 INFO L93 Difference]: Finished difference Result 9885 states and 29216 transitions. [2019-12-18 12:33:37,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:33:37,001 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-18 12:33:37,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:37,016 INFO L225 Difference]: With dead ends: 9885 [2019-12-18 12:33:37,016 INFO L226 Difference]: Without dead ends: 7229 [2019-12-18 12:33:37,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:33:37,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7229 states. [2019-12-18 12:33:37,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7229 to 7229. [2019-12-18 12:33:37,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7229 states. [2019-12-18 12:33:37,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7229 states to 7229 states and 23187 transitions. [2019-12-18 12:33:37,194 INFO L78 Accepts]: Start accepts. Automaton has 7229 states and 23187 transitions. Word has length 41 [2019-12-18 12:33:37,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:37,195 INFO L462 AbstractCegarLoop]: Abstraction has 7229 states and 23187 transitions. [2019-12-18 12:33:37,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:33:37,195 INFO L276 IsEmpty]: Start isEmpty. Operand 7229 states and 23187 transitions. [2019-12-18 12:33:37,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:33:37,211 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:37,212 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:33:37,212 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:33:37,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:37,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1814888115, now seen corresponding path program 1 times [2019-12-18 12:33:37,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:37,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996506666] [2019-12-18 12:33:37,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:37,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:37,338 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 12:33:37,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996506666] [2019-12-18 12:33:37,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:37,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:33:37,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944655342] [2019-12-18 12:33:37,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:33:37,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:37,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:33:37,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:33:37,343 INFO L87 Difference]: Start difference. First operand 7229 states and 23187 transitions. Second operand 7 states. [2019-12-18 12:33:37,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:37,731 INFO L93 Difference]: Finished difference Result 14422 states and 45321 transitions. [2019-12-18 12:33:37,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:33:37,732 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:33:37,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:37,761 INFO L225 Difference]: With dead ends: 14422 [2019-12-18 12:33:37,761 INFO L226 Difference]: Without dead ends: 10622 [2019-12-18 12:33:37,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:33:37,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10622 states. [2019-12-18 12:33:38,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10622 to 8672. [2019-12-18 12:33:38,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8672 states. [2019-12-18 12:33:38,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8672 states to 8672 states and 27717 transitions. [2019-12-18 12:33:38,026 INFO L78 Accepts]: Start accepts. Automaton has 8672 states and 27717 transitions. Word has length 65 [2019-12-18 12:33:38,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:38,027 INFO L462 AbstractCegarLoop]: Abstraction has 8672 states and 27717 transitions. [2019-12-18 12:33:38,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:33:38,027 INFO L276 IsEmpty]: Start isEmpty. Operand 8672 states and 27717 transitions. [2019-12-18 12:33:38,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:33:38,043 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:38,043 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:33:38,043 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:33:38,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:38,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1698408595, now seen corresponding path program 2 times [2019-12-18 12:33:38,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:38,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106286473] [2019-12-18 12:33:38,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:38,134 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 12:33:38,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106286473] [2019-12-18 12:33:38,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:38,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:33:38,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859052637] [2019-12-18 12:33:38,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:33:38,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:38,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:33:38,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:33:38,140 INFO L87 Difference]: Start difference. First operand 8672 states and 27717 transitions. Second operand 7 states. [2019-12-18 12:33:38,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:38,397 INFO L93 Difference]: Finished difference Result 16974 states and 52972 transitions. [2019-12-18 12:33:38,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:33:38,397 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:33:38,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:38,417 INFO L225 Difference]: With dead ends: 16974 [2019-12-18 12:33:38,417 INFO L226 Difference]: Without dead ends: 12606 [2019-12-18 12:33:38,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:33:38,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12606 states. [2019-12-18 12:33:38,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12606 to 10248. [2019-12-18 12:33:38,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10248 states. [2019-12-18 12:33:38,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10248 states to 10248 states and 32523 transitions. [2019-12-18 12:33:38,591 INFO L78 Accepts]: Start accepts. Automaton has 10248 states and 32523 transitions. Word has length 65 [2019-12-18 12:33:38,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:38,591 INFO L462 AbstractCegarLoop]: Abstraction has 10248 states and 32523 transitions. [2019-12-18 12:33:38,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:33:38,591 INFO L276 IsEmpty]: Start isEmpty. Operand 10248 states and 32523 transitions. [2019-12-18 12:33:38,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:33:38,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:38,602 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:33:38,603 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:33:38,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:38,603 INFO L82 PathProgramCache]: Analyzing trace with hash 441727413, now seen corresponding path program 3 times [2019-12-18 12:33:38,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:38,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714382952] [2019-12-18 12:33:38,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:38,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:38,729 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 12:33:38,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714382952] [2019-12-18 12:33:38,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:38,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:33:38,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833318532] [2019-12-18 12:33:38,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:33:38,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:38,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:33:38,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:33:38,734 INFO L87 Difference]: Start difference. First operand 10248 states and 32523 transitions. Second operand 9 states. [2019-12-18 12:33:39,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:39,911 INFO L93 Difference]: Finished difference Result 29736 states and 92724 transitions. [2019-12-18 12:33:39,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:33:39,911 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:33:39,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:39,950 INFO L225 Difference]: With dead ends: 29736 [2019-12-18 12:33:39,950 INFO L226 Difference]: Without dead ends: 27529 [2019-12-18 12:33:39,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:33:40,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27529 states. [2019-12-18 12:33:40,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27529 to 10383. [2019-12-18 12:33:40,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10383 states. [2019-12-18 12:33:40,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10383 states to 10383 states and 33015 transitions. [2019-12-18 12:33:40,240 INFO L78 Accepts]: Start accepts. Automaton has 10383 states and 33015 transitions. Word has length 65 [2019-12-18 12:33:40,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:40,240 INFO L462 AbstractCegarLoop]: Abstraction has 10383 states and 33015 transitions. [2019-12-18 12:33:40,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:33:40,241 INFO L276 IsEmpty]: Start isEmpty. Operand 10383 states and 33015 transitions. [2019-12-18 12:33:40,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:33:40,253 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:40,253 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:33:40,253 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:33:40,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:40,254 INFO L82 PathProgramCache]: Analyzing trace with hash 157752271, now seen corresponding path program 4 times [2019-12-18 12:33:40,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:40,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852451123] [2019-12-18 12:33:40,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:40,352 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 12:33:40,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852451123] [2019-12-18 12:33:40,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:40,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:33:40,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605742145] [2019-12-18 12:33:40,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:33:40,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:40,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:33:40,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:33:40,356 INFO L87 Difference]: Start difference. First operand 10383 states and 33015 transitions. Second operand 9 states. [2019-12-18 12:33:41,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:41,274 INFO L93 Difference]: Finished difference Result 23756 states and 74142 transitions. [2019-12-18 12:33:41,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 12:33:41,275 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:33:41,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:41,308 INFO L225 Difference]: With dead ends: 23756 [2019-12-18 12:33:41,308 INFO L226 Difference]: Without dead ends: 22003 [2019-12-18 12:33:41,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-18 12:33:41,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22003 states. [2019-12-18 12:33:41,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22003 to 10263. [2019-12-18 12:33:41,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10263 states. [2019-12-18 12:33:41,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10263 states to 10263 states and 32659 transitions. [2019-12-18 12:33:41,560 INFO L78 Accepts]: Start accepts. Automaton has 10263 states and 32659 transitions. Word has length 65 [2019-12-18 12:33:41,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:41,560 INFO L462 AbstractCegarLoop]: Abstraction has 10263 states and 32659 transitions. [2019-12-18 12:33:41,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:33:41,561 INFO L276 IsEmpty]: Start isEmpty. Operand 10263 states and 32659 transitions. [2019-12-18 12:33:41,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:33:41,573 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:41,573 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:33:41,573 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:33:41,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:41,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1717231753, now seen corresponding path program 5 times [2019-12-18 12:33:41,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:41,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166924207] [2019-12-18 12:33:41,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:41,633 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 12:33:41,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166924207] [2019-12-18 12:33:41,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:41,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:33:41,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314324021] [2019-12-18 12:33:41,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:33:41,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:41,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:33:41,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:33:41,635 INFO L87 Difference]: Start difference. First operand 10263 states and 32659 transitions. Second operand 3 states. [2019-12-18 12:33:41,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:41,734 INFO L93 Difference]: Finished difference Result 11836 states and 37521 transitions. [2019-12-18 12:33:41,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:33:41,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 12:33:41,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:41,757 INFO L225 Difference]: With dead ends: 11836 [2019-12-18 12:33:41,757 INFO L226 Difference]: Without dead ends: 11836 [2019-12-18 12:33:41,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 12:33:41,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11836 states. [2019-12-18 12:33:42,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11836 to 10692. [2019-12-18 12:33:42,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10692 states. [2019-12-18 12:33:42,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10692 states to 10692 states and 34089 transitions. [2019-12-18 12:33:42,070 INFO L78 Accepts]: Start accepts. Automaton has 10692 states and 34089 transitions. Word has length 65 [2019-12-18 12:33:42,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:42,070 INFO L462 AbstractCegarLoop]: Abstraction has 10692 states and 34089 transitions. [2019-12-18 12:33:42,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:33:42,071 INFO L276 IsEmpty]: Start isEmpty. Operand 10692 states and 34089 transitions. [2019-12-18 12:33:42,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:33:42,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:42,095 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:33:42,095 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:33:42,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:42,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1333392690, now seen corresponding path program 1 times [2019-12-18 12:33:42,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:42,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603444584] [2019-12-18 12:33:42,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:42,275 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 12:33:42,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603444584] [2019-12-18 12:33:42,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:42,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:33:42,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593910138] [2019-12-18 12:33:42,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:33:42,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:42,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:33:42,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:33:42,278 INFO L87 Difference]: Start difference. First operand 10692 states and 34089 transitions. Second operand 9 states. [2019-12-18 12:33:43,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:43,499 INFO L93 Difference]: Finished difference Result 25970 states and 80350 transitions. [2019-12-18 12:33:43,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 12:33:43,499 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 12:33:43,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:43,532 INFO L225 Difference]: With dead ends: 25970 [2019-12-18 12:33:43,532 INFO L226 Difference]: Without dead ends: 21900 [2019-12-18 12:33:43,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2019-12-18 12:33:43,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21900 states. [2019-12-18 12:33:43,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21900 to 10557. [2019-12-18 12:33:43,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10557 states. [2019-12-18 12:33:43,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10557 states to 10557 states and 33263 transitions. [2019-12-18 12:33:43,785 INFO L78 Accepts]: Start accepts. Automaton has 10557 states and 33263 transitions. Word has length 66 [2019-12-18 12:33:43,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:43,785 INFO L462 AbstractCegarLoop]: Abstraction has 10557 states and 33263 transitions. [2019-12-18 12:33:43,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:33:43,786 INFO L276 IsEmpty]: Start isEmpty. Operand 10557 states and 33263 transitions. [2019-12-18 12:33:44,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:33:44,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:44,042 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:33:44,042 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:33:44,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:44,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1392075118, now seen corresponding path program 2 times [2019-12-18 12:33:44,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:44,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268196286] [2019-12-18 12:33:44,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:44,140 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 12:33:44,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268196286] [2019-12-18 12:33:44,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:44,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:33:44,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313335645] [2019-12-18 12:33:44,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:33:44,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:44,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:33:44,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:33:44,142 INFO L87 Difference]: Start difference. First operand 10557 states and 33263 transitions. Second operand 9 states. [2019-12-18 12:33:44,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:44,958 INFO L93 Difference]: Finished difference Result 21145 states and 64916 transitions. [2019-12-18 12:33:44,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:33:44,958 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 12:33:44,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:44,988 INFO L225 Difference]: With dead ends: 21145 [2019-12-18 12:33:44,989 INFO L226 Difference]: Without dead ends: 19280 [2019-12-18 12:33:44,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2019-12-18 12:33:45,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19280 states. [2019-12-18 12:33:45,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19280 to 10197. [2019-12-18 12:33:45,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10197 states. [2019-12-18 12:33:45,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10197 states to 10197 states and 32201 transitions. [2019-12-18 12:33:45,224 INFO L78 Accepts]: Start accepts. Automaton has 10197 states and 32201 transitions. Word has length 66 [2019-12-18 12:33:45,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:45,224 INFO L462 AbstractCegarLoop]: Abstraction has 10197 states and 32201 transitions. [2019-12-18 12:33:45,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:33:45,225 INFO L276 IsEmpty]: Start isEmpty. Operand 10197 states and 32201 transitions. [2019-12-18 12:33:45,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:33:45,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:45,237 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:33:45,238 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:33:45,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:45,238 INFO L82 PathProgramCache]: Analyzing trace with hash 283101390, now seen corresponding path program 3 times [2019-12-18 12:33:45,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:45,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8753376] [2019-12-18 12:33:45,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:45,337 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 12:33:45,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8753376] [2019-12-18 12:33:45,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:45,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:33:45,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694988041] [2019-12-18 12:33:45,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:33:45,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:45,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:33:45,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:33:45,338 INFO L87 Difference]: Start difference. First operand 10197 states and 32201 transitions. Second operand 7 states. [2019-12-18 12:33:46,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:46,718 INFO L93 Difference]: Finished difference Result 23499 states and 70445 transitions. [2019-12-18 12:33:46,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 12:33:46,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 12:33:46,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:46,752 INFO L225 Difference]: With dead ends: 23499 [2019-12-18 12:33:46,752 INFO L226 Difference]: Without dead ends: 23331 [2019-12-18 12:33:46,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-12-18 12:33:46,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23331 states. [2019-12-18 12:33:47,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23331 to 14547. [2019-12-18 12:33:47,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14547 states. [2019-12-18 12:33:47,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14547 states to 14547 states and 44878 transitions. [2019-12-18 12:33:47,032 INFO L78 Accepts]: Start accepts. Automaton has 14547 states and 44878 transitions. Word has length 66 [2019-12-18 12:33:47,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:47,032 INFO L462 AbstractCegarLoop]: Abstraction has 14547 states and 44878 transitions. [2019-12-18 12:33:47,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:33:47,032 INFO L276 IsEmpty]: Start isEmpty. Operand 14547 states and 44878 transitions. [2019-12-18 12:33:47,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:33:47,047 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:47,047 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:33:47,048 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:33:47,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:47,048 INFO L82 PathProgramCache]: Analyzing trace with hash 346599794, now seen corresponding path program 1 times [2019-12-18 12:33:47,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:47,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751974518] [2019-12-18 12:33:47,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:47,116 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 12:33:47,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751974518] [2019-12-18 12:33:47,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:47,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:33:47,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670188672] [2019-12-18 12:33:47,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:33:47,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:47,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:33:47,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:33:47,118 INFO L87 Difference]: Start difference. First operand 14547 states and 44878 transitions. Second operand 4 states. [2019-12-18 12:33:47,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:47,246 INFO L93 Difference]: Finished difference Result 14395 states and 44238 transitions. [2019-12-18 12:33:47,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:33:47,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 12:33:47,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:47,278 INFO L225 Difference]: With dead ends: 14395 [2019-12-18 12:33:47,278 INFO L226 Difference]: Without dead ends: 14395 [2019-12-18 12:33:47,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:33:47,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14395 states. [2019-12-18 12:33:47,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14395 to 13189. [2019-12-18 12:33:47,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13189 states. [2019-12-18 12:33:47,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13189 states to 13189 states and 40582 transitions. [2019-12-18 12:33:47,700 INFO L78 Accepts]: Start accepts. Automaton has 13189 states and 40582 transitions. Word has length 66 [2019-12-18 12:33:47,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:47,700 INFO L462 AbstractCegarLoop]: Abstraction has 13189 states and 40582 transitions. [2019-12-18 12:33:47,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:33:47,701 INFO L276 IsEmpty]: Start isEmpty. Operand 13189 states and 40582 transitions. [2019-12-18 12:33:47,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:33:47,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:47,725 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:33:47,725 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:33:47,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:47,726 INFO L82 PathProgramCache]: Analyzing trace with hash 889984155, now seen corresponding path program 1 times [2019-12-18 12:33:47,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:47,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43123751] [2019-12-18 12:33:47,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:47,797 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 12:33:47,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43123751] [2019-12-18 12:33:47,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:47,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:33:47,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006051198] [2019-12-18 12:33:47,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:33:47,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:47,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:33:47,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:33:47,799 INFO L87 Difference]: Start difference. First operand 13189 states and 40582 transitions. Second operand 3 states. [2019-12-18 12:33:47,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:47,852 INFO L93 Difference]: Finished difference Result 11220 states and 33874 transitions. [2019-12-18 12:33:47,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:33:47,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 12:33:47,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:47,871 INFO L225 Difference]: With dead ends: 11220 [2019-12-18 12:33:47,872 INFO L226 Difference]: Without dead ends: 11220 [2019-12-18 12:33:47,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 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 12:33:47,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11220 states. [2019-12-18 12:33:48,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11220 to 10998. [2019-12-18 12:33:48,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10998 states. [2019-12-18 12:33:48,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10998 states to 10998 states and 33228 transitions. [2019-12-18 12:33:48,114 INFO L78 Accepts]: Start accepts. Automaton has 10998 states and 33228 transitions. Word has length 66 [2019-12-18 12:33:48,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:48,114 INFO L462 AbstractCegarLoop]: Abstraction has 10998 states and 33228 transitions. [2019-12-18 12:33:48,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:33:48,114 INFO L276 IsEmpty]: Start isEmpty. Operand 10998 states and 33228 transitions. [2019-12-18 12:33:48,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:33:48,127 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:48,127 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:33:48,127 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:33:48,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:48,128 INFO L82 PathProgramCache]: Analyzing trace with hash 2078724657, now seen corresponding path program 1 times [2019-12-18 12:33:48,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:48,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415013539] [2019-12-18 12:33:48,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:48,539 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 12:33:48,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415013539] [2019-12-18 12:33:48,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:48,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:33:48,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990726093] [2019-12-18 12:33:48,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:33:48,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:48,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:33:48,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:33:48,541 INFO L87 Difference]: Start difference. First operand 10998 states and 33228 transitions. Second operand 9 states. [2019-12-18 12:33:49,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:49,552 INFO L93 Difference]: Finished difference Result 20805 states and 61926 transitions. [2019-12-18 12:33:49,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 12:33:49,553 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-18 12:33:49,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:49,588 INFO L225 Difference]: With dead ends: 20805 [2019-12-18 12:33:49,588 INFO L226 Difference]: Without dead ends: 15106 [2019-12-18 12:33:49,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-18 12:33:49,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15106 states. [2019-12-18 12:33:49,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15106 to 11621. [2019-12-18 12:33:49,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11621 states. [2019-12-18 12:33:49,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11621 states to 11621 states and 34761 transitions. [2019-12-18 12:33:49,996 INFO L78 Accepts]: Start accepts. Automaton has 11621 states and 34761 transitions. Word has length 67 [2019-12-18 12:33:49,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:49,997 INFO L462 AbstractCegarLoop]: Abstraction has 11621 states and 34761 transitions. [2019-12-18 12:33:49,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:33:49,997 INFO L276 IsEmpty]: Start isEmpty. Operand 11621 states and 34761 transitions. [2019-12-18 12:33:50,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:33:50,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:50,021 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:33:50,022 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:33:50,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:50,022 INFO L82 PathProgramCache]: Analyzing trace with hash 721495091, now seen corresponding path program 2 times [2019-12-18 12:33:50,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:50,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395104910] [2019-12-18 12:33:50,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:50,295 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 12:33:50,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395104910] [2019-12-18 12:33:50,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:50,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:33:50,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959144691] [2019-12-18 12:33:50,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:33:50,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:50,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:33:50,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:33:50,299 INFO L87 Difference]: Start difference. First operand 11621 states and 34761 transitions. Second operand 10 states. [2019-12-18 12:33:50,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:50,980 INFO L93 Difference]: Finished difference Result 17276 states and 51157 transitions. [2019-12-18 12:33:50,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 12:33:50,980 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 12:33:50,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:51,002 INFO L225 Difference]: With dead ends: 17276 [2019-12-18 12:33:51,002 INFO L226 Difference]: Without dead ends: 16257 [2019-12-18 12:33:51,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2019-12-18 12:33:51,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16257 states. [2019-12-18 12:33:51,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16257 to 13570. [2019-12-18 12:33:51,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13570 states. [2019-12-18 12:33:51,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13570 states to 13570 states and 40412 transitions. [2019-12-18 12:33:51,221 INFO L78 Accepts]: Start accepts. Automaton has 13570 states and 40412 transitions. Word has length 67 [2019-12-18 12:33:51,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:51,221 INFO L462 AbstractCegarLoop]: Abstraction has 13570 states and 40412 transitions. [2019-12-18 12:33:51,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:33:51,222 INFO L276 IsEmpty]: Start isEmpty. Operand 13570 states and 40412 transitions. [2019-12-18 12:33:51,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:33:51,235 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:51,236 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:33:51,236 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:33:51,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:51,236 INFO L82 PathProgramCache]: Analyzing trace with hash 957967249, now seen corresponding path program 3 times [2019-12-18 12:33:51,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:51,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894621819] [2019-12-18 12:33:51,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:51,579 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 12:33:51,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894621819] [2019-12-18 12:33:51,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:51,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 12:33:51,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408357188] [2019-12-18 12:33:51,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 12:33:51,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:51,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 12:33:51,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:33:51,580 INFO L87 Difference]: Start difference. First operand 13570 states and 40412 transitions. Second operand 14 states. [2019-12-18 12:33:53,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:53,580 INFO L93 Difference]: Finished difference Result 17220 states and 50344 transitions. [2019-12-18 12:33:53,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-18 12:33:53,586 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-12-18 12:33:53,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:53,605 INFO L225 Difference]: With dead ends: 17220 [2019-12-18 12:33:53,605 INFO L226 Difference]: Without dead ends: 15325 [2019-12-18 12:33:53,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=293, Invalid=1347, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 12:33:53,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15325 states. [2019-12-18 12:33:53,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15325 to 12938. [2019-12-18 12:33:53,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12938 states. [2019-12-18 12:33:53,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12938 states to 12938 states and 38418 transitions. [2019-12-18 12:33:53,804 INFO L78 Accepts]: Start accepts. Automaton has 12938 states and 38418 transitions. Word has length 67 [2019-12-18 12:33:53,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:53,804 INFO L462 AbstractCegarLoop]: Abstraction has 12938 states and 38418 transitions. [2019-12-18 12:33:53,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 12:33:53,804 INFO L276 IsEmpty]: Start isEmpty. Operand 12938 states and 38418 transitions. [2019-12-18 12:33:53,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:33:53,817 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:53,817 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:33:53,817 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:33:53,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:53,817 INFO L82 PathProgramCache]: Analyzing trace with hash -231798721, now seen corresponding path program 4 times [2019-12-18 12:33:53,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:53,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25283884] [2019-12-18 12:33:53,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:54,238 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 12:33:54,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25283884] [2019-12-18 12:33:54,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:54,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:33:54,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963623332] [2019-12-18 12:33:54,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:33:54,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:54,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:33:54,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:33:54,240 INFO L87 Difference]: Start difference. First operand 12938 states and 38418 transitions. Second operand 10 states. [2019-12-18 12:33:54,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:54,789 INFO L93 Difference]: Finished difference Result 16102 states and 47121 transitions. [2019-12-18 12:33:54,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:33:54,790 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 12:33:54,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:54,811 INFO L225 Difference]: With dead ends: 16102 [2019-12-18 12:33:54,811 INFO L226 Difference]: Without dead ends: 14313 [2019-12-18 12:33:54,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-18 12:33:54,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14313 states. [2019-12-18 12:33:54,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14313 to 11325. [2019-12-18 12:33:54,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11325 states. [2019-12-18 12:33:55,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11325 states to 11325 states and 33878 transitions. [2019-12-18 12:33:55,006 INFO L78 Accepts]: Start accepts. Automaton has 11325 states and 33878 transitions. Word has length 67 [2019-12-18 12:33:55,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:55,006 INFO L462 AbstractCegarLoop]: Abstraction has 11325 states and 33878 transitions. [2019-12-18 12:33:55,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:33:55,007 INFO L276 IsEmpty]: Start isEmpty. Operand 11325 states and 33878 transitions. [2019-12-18 12:33:55,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:33:55,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:55,019 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:33:55,019 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:33:55,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:55,019 INFO L82 PathProgramCache]: Analyzing trace with hash 88464887, now seen corresponding path program 5 times [2019-12-18 12:33:55,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:55,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85143510] [2019-12-18 12:33:55,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:55,212 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 12:33:55,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85143510] [2019-12-18 12:33:55,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:55,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:33:55,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573945633] [2019-12-18 12:33:55,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 12:33:55,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:55,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 12:33:55,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:33:55,214 INFO L87 Difference]: Start difference. First operand 11325 states and 33878 transitions. Second operand 12 states. [2019-12-18 12:33:57,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:57,399 INFO L93 Difference]: Finished difference Result 22172 states and 64838 transitions. [2019-12-18 12:33:57,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 12:33:57,400 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 12:33:57,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:57,422 INFO L225 Difference]: With dead ends: 22172 [2019-12-18 12:33:57,422 INFO L226 Difference]: Without dead ends: 15637 [2019-12-18 12:33:57,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=771, Unknown=0, NotChecked=0, Total=930 [2019-12-18 12:33:57,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15637 states. [2019-12-18 12:33:57,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15637 to 11543. [2019-12-18 12:33:57,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11543 states. [2019-12-18 12:33:57,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11543 states to 11543 states and 34235 transitions. [2019-12-18 12:33:57,614 INFO L78 Accepts]: Start accepts. Automaton has 11543 states and 34235 transitions. Word has length 67 [2019-12-18 12:33:57,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:57,615 INFO L462 AbstractCegarLoop]: Abstraction has 11543 states and 34235 transitions. [2019-12-18 12:33:57,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 12:33:57,615 INFO L276 IsEmpty]: Start isEmpty. Operand 11543 states and 34235 transitions. [2019-12-18 12:33:57,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:33:57,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:57,627 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:33:57,627 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:33:57,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:57,627 INFO L82 PathProgramCache]: Analyzing trace with hash 575406353, now seen corresponding path program 6 times [2019-12-18 12:33:57,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:57,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283678337] [2019-12-18 12:33:57,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:57,795 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 12:33:57,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283678337] [2019-12-18 12:33:57,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:57,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:33:57,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673207820] [2019-12-18 12:33:57,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:33:57,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:57,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:33:57,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:33:57,797 INFO L87 Difference]: Start difference. First operand 11543 states and 34235 transitions. Second operand 11 states. [2019-12-18 12:33:58,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:33:58,721 INFO L93 Difference]: Finished difference Result 16601 states and 49061 transitions. [2019-12-18 12:33:58,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 12:33:58,722 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 12:33:58,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:33:58,746 INFO L225 Difference]: With dead ends: 16601 [2019-12-18 12:33:58,746 INFO L226 Difference]: Without dead ends: 15582 [2019-12-18 12:33:58,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2019-12-18 12:33:58,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15582 states. [2019-12-18 12:33:58,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15582 to 13654. [2019-12-18 12:33:58,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13654 states. [2019-12-18 12:33:58,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13654 states to 13654 states and 40576 transitions. [2019-12-18 12:33:58,981 INFO L78 Accepts]: Start accepts. Automaton has 13654 states and 40576 transitions. Word has length 67 [2019-12-18 12:33:58,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:33:58,981 INFO L462 AbstractCegarLoop]: Abstraction has 13654 states and 40576 transitions. [2019-12-18 12:33:58,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:33:58,981 INFO L276 IsEmpty]: Start isEmpty. Operand 13654 states and 40576 transitions. [2019-12-18 12:33:58,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:33:58,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:33:58,996 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:33:58,996 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:33:58,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:33:58,996 INFO L82 PathProgramCache]: Analyzing trace with hash -600013973, now seen corresponding path program 7 times [2019-12-18 12:33:58,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:33:58,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49740369] [2019-12-18 12:33:58,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:33:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:33:59,149 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 12:33:59,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49740369] [2019-12-18 12:33:59,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:33:59,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:33:59,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273106701] [2019-12-18 12:33:59,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:33:59,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:33:59,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:33:59,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:33:59,152 INFO L87 Difference]: Start difference. First operand 13654 states and 40576 transitions. Second operand 11 states. [2019-12-18 12:34:00,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:00,184 INFO L93 Difference]: Finished difference Result 16332 states and 47621 transitions. [2019-12-18 12:34:00,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 12:34:00,185 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 12:34:00,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:00,202 INFO L225 Difference]: With dead ends: 16332 [2019-12-18 12:34:00,202 INFO L226 Difference]: Without dead ends: 13488 [2019-12-18 12:34:00,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-18 12:34:00,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13488 states. [2019-12-18 12:34:00,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13488 to 11297. [2019-12-18 12:34:00,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11297 states. [2019-12-18 12:34:00,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11297 states to 11297 states and 33662 transitions. [2019-12-18 12:34:00,381 INFO L78 Accepts]: Start accepts. Automaton has 11297 states and 33662 transitions. Word has length 67 [2019-12-18 12:34:00,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:00,381 INFO L462 AbstractCegarLoop]: Abstraction has 11297 states and 33662 transitions. [2019-12-18 12:34:00,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:34:00,382 INFO L276 IsEmpty]: Start isEmpty. Operand 11297 states and 33662 transitions. [2019-12-18 12:34:00,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:34:00,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:00,393 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:34:00,393 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:34:00,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:00,393 INFO L82 PathProgramCache]: Analyzing trace with hash 975038819, now seen corresponding path program 8 times [2019-12-18 12:34:00,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:00,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690104411] [2019-12-18 12:34:00,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:00,546 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 12:34:00,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690104411] [2019-12-18 12:34:00,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:00,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:34:00,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330913399] [2019-12-18 12:34:00,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:34:00,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:00,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:34:00,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:34:00,548 INFO L87 Difference]: Start difference. First operand 11297 states and 33662 transitions. Second operand 10 states. [2019-12-18 12:34:01,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:01,582 INFO L93 Difference]: Finished difference Result 14311 states and 41545 transitions. [2019-12-18 12:34:01,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 12:34:01,583 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 12:34:01,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:01,602 INFO L225 Difference]: With dead ends: 14311 [2019-12-18 12:34:01,602 INFO L226 Difference]: Without dead ends: 13472 [2019-12-18 12:34:01,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-12-18 12:34:01,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13472 states. [2019-12-18 12:34:01,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13472 to 10927. [2019-12-18 12:34:01,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10927 states. [2019-12-18 12:34:01,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10927 states to 10927 states and 32628 transitions. [2019-12-18 12:34:01,785 INFO L78 Accepts]: Start accepts. Automaton has 10927 states and 32628 transitions. Word has length 67 [2019-12-18 12:34:01,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:01,785 INFO L462 AbstractCegarLoop]: Abstraction has 10927 states and 32628 transitions. [2019-12-18 12:34:01,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:34:01,785 INFO L276 IsEmpty]: Start isEmpty. Operand 10927 states and 32628 transitions. [2019-12-18 12:34:01,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:34:01,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:01,797 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:34:01,797 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:34:01,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:01,797 INFO L82 PathProgramCache]: Analyzing trace with hash -478785703, now seen corresponding path program 9 times [2019-12-18 12:34:01,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:01,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986782945] [2019-12-18 12:34:01,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:01,935 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 12:34:01,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986782945] [2019-12-18 12:34:01,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:01,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:34:01,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914190575] [2019-12-18 12:34:01,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:34:01,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:01,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:34:01,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:34:01,937 INFO L87 Difference]: Start difference. First operand 10927 states and 32628 transitions. Second operand 10 states. [2019-12-18 12:34:02,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:02,954 INFO L93 Difference]: Finished difference Result 13908 states and 40682 transitions. [2019-12-18 12:34:02,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:34:02,955 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 12:34:02,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:02,976 INFO L225 Difference]: With dead ends: 13908 [2019-12-18 12:34:02,976 INFO L226 Difference]: Without dead ends: 13665 [2019-12-18 12:34:02,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-18 12:34:03,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13665 states. [2019-12-18 12:34:03,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13665 to 10943. [2019-12-18 12:34:03,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10943 states. [2019-12-18 12:34:03,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10943 states to 10943 states and 32668 transitions. [2019-12-18 12:34:03,177 INFO L78 Accepts]: Start accepts. Automaton has 10943 states and 32668 transitions. Word has length 67 [2019-12-18 12:34:03,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:03,177 INFO L462 AbstractCegarLoop]: Abstraction has 10943 states and 32668 transitions. [2019-12-18 12:34:03,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:34:03,178 INFO L276 IsEmpty]: Start isEmpty. Operand 10943 states and 32668 transitions. [2019-12-18 12:34:03,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:34:03,191 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:03,191 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:34:03,191 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:34:03,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:03,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1516551711, now seen corresponding path program 10 times [2019-12-18 12:34:03,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:03,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521420440] [2019-12-18 12:34:03,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:03,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:34:03,699 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 12:34:03,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521420440] [2019-12-18 12:34:03,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:34:03,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 12:34:03,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853846663] [2019-12-18 12:34:03,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 12:34:03,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:34:03,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 12:34:03,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-18 12:34:03,701 INFO L87 Difference]: Start difference. First operand 10943 states and 32668 transitions. Second operand 17 states. [2019-12-18 12:34:06,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:34:06,167 INFO L93 Difference]: Finished difference Result 14188 states and 41379 transitions. [2019-12-18 12:34:06,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-18 12:34:06,167 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-18 12:34:06,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:34:06,187 INFO L225 Difference]: With dead ends: 14188 [2019-12-18 12:34:06,188 INFO L226 Difference]: Without dead ends: 13967 [2019-12-18 12:34:06,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=321, Invalid=1401, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 12:34:06,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13967 states. [2019-12-18 12:34:06,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13967 to 10767. [2019-12-18 12:34:06,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10767 states. [2019-12-18 12:34:06,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10767 states to 10767 states and 32196 transitions. [2019-12-18 12:34:06,592 INFO L78 Accepts]: Start accepts. Automaton has 10767 states and 32196 transitions. Word has length 67 [2019-12-18 12:34:06,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:34:06,592 INFO L462 AbstractCegarLoop]: Abstraction has 10767 states and 32196 transitions. [2019-12-18 12:34:06,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 12:34:06,592 INFO L276 IsEmpty]: Start isEmpty. Operand 10767 states and 32196 transitions. [2019-12-18 12:34:06,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:34:06,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:34:06,604 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:34:06,604 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:34:06,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:34:06,605 INFO L82 PathProgramCache]: Analyzing trace with hash -494782975, now seen corresponding path program 11 times [2019-12-18 12:34:06,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:34:06,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369121] [2019-12-18 12:34:06,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:34:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:34:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:34:06,774 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:34:06,774 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:34:06,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [904] [904] ULTIMATE.startENTRY-->L837: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t391~0.base_29|) (= 0 v_~weak$$choice0~0_10) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t391~0.base_29| 4)) (= v_~a$r_buff1_thd0~0_132 0) (= 0 v_~a$w_buff0_used~0_689) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t391~0.base_29| 1)) (= 0 v_~a$w_buff1_used~0_376) (= v_~a$r_buff0_thd3~0_328 0) (= |v_#NULL.offset_6| 0) (= v_~y~0_79 0) (= 0 |v_ULTIMATE.start_main_~#t391~0.offset_22|) (= 0 v_~a$r_buff1_thd1~0_125) (= 0 v_~__unbuffered_p0_EAX~0_92) (= 0 v_~__unbuffered_p1_EAX~0_37) (= v_~x~0_69 0) (= 0 v_~a$r_buff1_thd2~0_129) (< 0 |v_#StackHeapBarrier_17|) (= v_~__unbuffered_p0_EBX~0_92 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t391~0.base_29|)) (= v_~a$flush_delayed~0_23 0) (= v_~a$r_buff1_thd3~0_224 0) (= v_~__unbuffered_p2_EBX~0_38 0) (= 0 v_~__unbuffered_cnt~0_98) (= v_~main$tmp_guard0~0_28 0) (= 0 v_~a$r_buff0_thd2~0_124) (= v_~a~0_181 0) (= 0 |v_#NULL.base_6|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t391~0.base_29| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t391~0.base_29|) |v_ULTIMATE.start_main_~#t391~0.offset_22| 0)) |v_#memory_int_21|) (= 0 v_~__unbuffered_p2_EAX~0_33) (= 0 v_~a$r_buff0_thd1~0_195) (= v_~a$mem_tmp~0_12 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~a$w_buff1~0_172) (= v_~a$r_buff0_thd0~0_144 0) (= v_~a$w_buff0~0_228 0) (= v_~weak$$choice2~0_107 0) (= v_~z~0_20 0) (= 0 v_~a$read_delayed~0_6) (= v_~a$read_delayed_var~0.offset_6 0) (= 0 v_~a$read_delayed_var~0.base_6))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_129, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_51|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_281|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_144, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_31|, ~a~0=v_~a~0_181, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_67|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_92, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ULTIMATE.start_main_~#t392~0.base=|v_ULTIMATE.start_main_~#t392~0.base_29|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_38, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_92, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_224, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_689, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_195, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_6, ~a$w_buff0~0=v_~a$w_buff0~0_228, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_132, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98, ~x~0=v_~x~0_69, ULTIMATE.start_main_~#t391~0.base=|v_ULTIMATE.start_main_~#t391~0.base_29|, ~a$read_delayed~0=v_~a$read_delayed~0_6, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_124, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_55|, ~a$mem_tmp~0=v_~a$mem_tmp~0_12, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ~a$w_buff1~0=v_~a$w_buff1~0_172, ~y~0=v_~y~0_79, ULTIMATE.start_main_~#t393~0.offset=|v_ULTIMATE.start_main_~#t393~0.offset_15|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_125, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_328, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, ULTIMATE.start_main_~#t392~0.offset=|v_ULTIMATE.start_main_~#t392~0.offset_22|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t393~0.base=|v_ULTIMATE.start_main_~#t393~0.base_17|, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_376, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t391~0.offset=|v_ULTIMATE.start_main_~#t391~0.offset_22|} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t392~0.base, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t391~0.base, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_~#t393~0.offset, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t392~0.offset, #NULL.base, ULTIMATE.start_main_~#t393~0.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base, ULTIMATE.start_main_~#t391~0.offset] because there is no mapped edge [2019-12-18 12:34:06,780 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L837-1-->L839: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t392~0.base_12|) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t392~0.base_12|) 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t392~0.base_12| 4) |v_#length_13|) (not (= 0 |v_ULTIMATE.start_main_~#t392~0.base_12|)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t392~0.base_12| 1)) (= 0 |v_ULTIMATE.start_main_~#t392~0.offset_10|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t392~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t392~0.base_12|) |v_ULTIMATE.start_main_~#t392~0.offset_10| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, ULTIMATE.start_main_~#t392~0.base=|v_ULTIMATE.start_main_~#t392~0.base_12|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t392~0.offset=|v_ULTIMATE.start_main_~#t392~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t392~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t392~0.offset] because there is no mapped edge [2019-12-18 12:34:06,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L839-1-->L841: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t393~0.offset_11|) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t393~0.base_13| 1) |v_#valid_36|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t393~0.base_13|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t393~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t393~0.base_13|) |v_ULTIMATE.start_main_~#t393~0.offset_11| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t393~0.base_13|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t393~0.base_13| 4)) (not (= |v_ULTIMATE.start_main_~#t393~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t393~0.offset=|v_ULTIMATE.start_main_~#t393~0.offset_11|, ULTIMATE.start_main_~#t393~0.base=|v_ULTIMATE.start_main_~#t393~0.base_13|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t393~0.offset, ULTIMATE.start_main_~#t393~0.base] because there is no mapped edge [2019-12-18 12:34:06,785 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L4-->L758: Formula: (and (= ~a$r_buff0_thd0~0_In880249609 ~a$r_buff1_thd0~0_Out880249609) (= ~a$r_buff1_thd1~0_Out880249609 ~a$r_buff0_thd1~0_In880249609) (= ~__unbuffered_p0_EAX~0_Out880249609 ~x~0_Out880249609) (= ~a$r_buff1_thd2~0_Out880249609 ~a$r_buff0_thd2~0_In880249609) (= ~a$r_buff0_thd3~0_In880249609 ~a$r_buff1_thd3~0_Out880249609) (= ~y~0_In880249609 ~__unbuffered_p0_EBX~0_Out880249609) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In880249609 0)) (= ~a$r_buff0_thd1~0_Out880249609 1) (= 1 ~x~0_Out880249609)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In880249609, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In880249609, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In880249609, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In880249609, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In880249609, ~y~0=~y~0_In880249609} OutVars{~__unbuffered_p0_EBX~0=~__unbuffered_p0_EBX~0_Out880249609, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out880249609, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out880249609, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out880249609, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In880249609, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In880249609, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out880249609, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In880249609, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out880249609, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out880249609, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In880249609, ~y~0=~y~0_In880249609, ~x~0=~x~0_Out880249609} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 12:34:06,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L759-->L759-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In1326593827 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In1326593827 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out1326593827|) (not .cse1)) (and (or .cse1 .cse0) (= ~a$w_buff0_used~0_In1326593827 |P0Thread1of1ForFork1_#t~ite5_Out1326593827|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1326593827, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1326593827} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1326593827|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1326593827, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1326593827} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 12:34:06,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L760-->L760-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In1161123068 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In1161123068 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In1161123068 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1161123068 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite6_Out1161123068| ~a$w_buff1_used~0_In1161123068)) (and (= |P0Thread1of1ForFork1_#t~ite6_Out1161123068| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1161123068, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1161123068, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1161123068, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1161123068} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1161123068|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1161123068, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1161123068, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1161123068, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1161123068} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 12:34:06,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L778-2-->L778-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In572672811 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In572672811 256) 0))) (or (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In572672811 |P1Thread1of1ForFork2_#t~ite9_Out572672811|)) (and (= ~a~0_In572672811 |P1Thread1of1ForFork2_#t~ite9_Out572672811|) (or .cse1 .cse0)))) InVars {~a~0=~a~0_In572672811, ~a$w_buff1~0=~a$w_buff1~0_In572672811, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In572672811, ~a$w_buff1_used~0=~a$w_buff1_used~0_In572672811} OutVars{~a~0=~a~0_In572672811, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out572672811|, ~a$w_buff1~0=~a$w_buff1~0_In572672811, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In572672811, ~a$w_buff1_used~0=~a$w_buff1_used~0_In572672811} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 12:34:06,793 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L778-4-->L779: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_12| v_~a~0_28) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_12|} OutVars{~a~0=v_~a~0_28, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_11|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_15|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 12:34:06,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L761-->L762: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-1308922956 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1308922956 256)))) (or (and (not .cse0) (= ~a$r_buff0_thd1~0_Out-1308922956 0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_In-1308922956 ~a$r_buff0_thd1~0_Out-1308922956)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1308922956, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1308922956} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1308922956|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1308922956, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1308922956} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:34:06,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L762-->L762-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In741615504 256))) (.cse0 (= (mod ~a$r_buff1_thd1~0_In741615504 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In741615504 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd1~0_In741615504 256) 0))) (or (and (= ~a$r_buff1_thd1~0_In741615504 |P0Thread1of1ForFork1_#t~ite8_Out741615504|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out741615504|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In741615504, ~a$w_buff0_used~0=~a$w_buff0_used~0_In741615504, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In741615504, ~a$w_buff1_used~0=~a$w_buff1_used~0_In741615504} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out741615504|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In741615504, ~a$w_buff0_used~0=~a$w_buff0_used~0_In741615504, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In741615504, ~a$w_buff1_used~0=~a$w_buff1_used~0_In741615504} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 12:34:06,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L762-2-->P0EXIT: Formula: (and (= v_~a$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork1_#t~ite8_36|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_cnt~0_49 (+ v_~__unbuffered_cnt~0_50 1)) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_35|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_63, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 12:34:06,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-264951267 256))) (.cse0 (= (mod ~a$r_buff0_thd2~0_In-264951267 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out-264951267| ~a$w_buff0_used~0_In-264951267) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-264951267| 0) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-264951267, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-264951267} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-264951267, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-264951267, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-264951267|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 12:34:06,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L803-->L803-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1270628404 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite21_Out-1270628404| ~a$w_buff0~0_In-1270628404) (= |P2Thread1of1ForFork0_#t~ite20_In-1270628404| |P2Thread1of1ForFork0_#t~ite20_Out-1270628404|) (not .cse0)) (and (= |P2Thread1of1ForFork0_#t~ite21_Out-1270628404| |P2Thread1of1ForFork0_#t~ite20_Out-1270628404|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1270628404 256)))) (or (and .cse1 (= (mod ~a$r_buff1_thd3~0_In-1270628404 256) 0)) (and .cse1 (= (mod ~a$w_buff1_used~0_In-1270628404 256) 0)) (= 0 (mod ~a$w_buff0_used~0_In-1270628404 256)))) .cse0 (= |P2Thread1of1ForFork0_#t~ite20_Out-1270628404| ~a$w_buff0~0_In-1270628404)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-1270628404, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1270628404, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1270628404, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1270628404, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1270628404, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-1270628404|, ~weak$$choice2~0=~weak$$choice2~0_In-1270628404} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-1270628404|, ~a$w_buff0~0=~a$w_buff0~0_In-1270628404, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1270628404, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1270628404, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1270628404, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-1270628404|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1270628404, ~weak$$choice2~0=~weak$$choice2~0_In-1270628404} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 12:34:06,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L804-->L804-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-162567048 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite23_In-162567048| |P2Thread1of1ForFork0_#t~ite23_Out-162567048|) (= ~a$w_buff1~0_In-162567048 |P2Thread1of1ForFork0_#t~ite24_Out-162567048|)) (and (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-162567048 256) 0))) (or (and (= 0 (mod ~a$w_buff1_used~0_In-162567048 256)) .cse1) (= 0 (mod ~a$w_buff0_used~0_In-162567048 256)) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In-162567048 256) 0)))) .cse0 (= |P2Thread1of1ForFork0_#t~ite24_Out-162567048| |P2Thread1of1ForFork0_#t~ite23_Out-162567048|) (= ~a$w_buff1~0_In-162567048 |P2Thread1of1ForFork0_#t~ite23_Out-162567048|)))) InVars {~a$w_buff1~0=~a$w_buff1~0_In-162567048, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-162567048|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-162567048, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-162567048, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-162567048, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-162567048, ~weak$$choice2~0=~weak$$choice2~0_In-162567048} OutVars{~a$w_buff1~0=~a$w_buff1~0_In-162567048, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-162567048|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-162567048|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-162567048, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-162567048, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-162567048, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-162567048, ~weak$$choice2~0=~weak$$choice2~0_In-162567048} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 12:34:06,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L805-->L805-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1147985913 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite26_In1147985913| |P2Thread1of1ForFork0_#t~ite26_Out1147985913|) (= |P2Thread1of1ForFork0_#t~ite27_Out1147985913| ~a$w_buff0_used~0_In1147985913) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite26_Out1147985913| |P2Thread1of1ForFork0_#t~ite27_Out1147985913|) (= |P2Thread1of1ForFork0_#t~ite26_Out1147985913| ~a$w_buff0_used~0_In1147985913) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1147985913 256)))) (or (= 0 (mod ~a$w_buff0_used~0_In1147985913 256)) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In1147985913 256))) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In1147985913 256)))))))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In1147985913|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1147985913, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1147985913, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1147985913, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1147985913, ~weak$$choice2~0=~weak$$choice2~0_In1147985913} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out1147985913|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out1147985913|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1147985913, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1147985913, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1147985913, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1147985913, ~weak$$choice2~0=~weak$$choice2~0_In1147985913} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 12:34:06,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-->L808: Formula: (and (= v_~a$r_buff0_thd3~0_53 v_~a$r_buff0_thd3~0_52) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_52, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 12:34:06,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L810-->L814: Formula: (and (not (= (mod v_~a$flush_delayed~0_7 256) 0)) (= v_~a~0_16 v_~a$mem_tmp~0_4) (= v_~a$flush_delayed~0_6 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_16, ~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_6} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 12:34:06,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L814-2-->L814-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In1076657146 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In1076657146 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out1076657146| ~a~0_In1076657146) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out1076657146| ~a$w_buff1~0_In1076657146) (not .cse1) (not .cse0)))) InVars {~a~0=~a~0_In1076657146, ~a$w_buff1~0=~a$w_buff1~0_In1076657146, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1076657146, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1076657146} OutVars{~a~0=~a~0_In1076657146, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1076657146|, ~a$w_buff1~0=~a$w_buff1~0_In1076657146, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1076657146, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1076657146} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 12:34:06,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L814-4-->L815: Formula: (= v_~a~0_36 |v_P2Thread1of1ForFork0_#t~ite38_10|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_10|} OutVars{~a~0=v_~a~0_36, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_9|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 12:34:06,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L815-->L815-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-990725010 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-990725010 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-990725010| ~a$w_buff0_used~0_In-990725010)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out-990725010| 0) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-990725010, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-990725010} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-990725010|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-990725010, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-990725010} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 12:34:06,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L816-->L816-2: Formula: (let ((.cse2 (= (mod ~a$w_buff0_used~0_In726300165 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd3~0_In726300165 256))) (.cse0 (= (mod ~a$r_buff1_thd3~0_In726300165 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In726300165 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out726300165| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork0_#t~ite41_Out726300165| ~a$w_buff1_used~0_In726300165) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In726300165, ~a$w_buff0_used~0=~a$w_buff0_used~0_In726300165, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In726300165, ~a$w_buff1_used~0=~a$w_buff1_used~0_In726300165} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In726300165, ~a$w_buff0_used~0=~a$w_buff0_used~0_In726300165, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In726300165, ~a$w_buff1_used~0=~a$w_buff1_used~0_In726300165, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out726300165|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 12:34:06,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L817-->L817-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-609048107 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-609048107 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out-609048107| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out-609048107| ~a$r_buff0_thd3~0_In-609048107)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-609048107, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-609048107} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-609048107, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-609048107, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-609048107|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 12:34:06,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L818-->L818-2: Formula: (let ((.cse2 (= (mod ~a$r_buff1_thd3~0_In-2072827565 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In-2072827565 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-2072827565 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-2072827565 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite43_Out-2072827565| 0)) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite43_Out-2072827565| ~a$r_buff1_thd3~0_In-2072827565) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2072827565, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2072827565, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2072827565, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2072827565} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-2072827565|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2072827565, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2072827565, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2072827565, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2072827565} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 12:34:06,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-874690425 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-874690425 256))) (.cse2 (= (mod ~a$r_buff0_thd2~0_In-874690425 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-874690425 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out-874690425| 0)) (and (or .cse1 .cse0) (= ~a$w_buff1_used~0_In-874690425 |P1Thread1of1ForFork2_#t~ite12_Out-874690425|) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-874690425, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-874690425, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-874690425, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-874690425} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-874690425, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-874690425, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-874690425, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-874690425|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-874690425} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 12:34:06,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In1225685227 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1225685227 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out1225685227| 0)) (and (= ~a$r_buff0_thd2~0_In1225685227 |P1Thread1of1ForFork2_#t~ite13_Out1225685227|) (or .cse1 .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1225685227, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1225685227} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1225685227, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1225685227, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1225685227|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 12:34:06,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L782-->L782-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1879284251 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-1879284251 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-1879284251 256))) (.cse2 (= (mod ~a$r_buff0_thd2~0_In-1879284251 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out-1879284251| 0)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out-1879284251| ~a$r_buff1_thd2~0_In-1879284251) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1879284251, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1879284251, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1879284251, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1879284251} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1879284251, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1879284251, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1879284251, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1879284251, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1879284251|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 12:34:06,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L818-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= v_~a$r_buff1_thd3~0_123 |v_P2Thread1of1ForFork0_#t~ite43_34|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_33|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_123, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 12:34:06,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L782-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_44| v_~a$r_buff1_thd2~0_99) (= (+ v_~__unbuffered_cnt~0_83 1) v_~__unbuffered_cnt~0_82) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_44|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_99, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_43|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 12:34:06,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L841-1-->L847: Formula: (and (= v_~main$tmp_guard0~0_9 1) (= 3 v_~__unbuffered_cnt~0_36)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 12:34:06,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L847-2-->L847-4: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In311408884 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In311408884 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out311408884| ~a~0_In311408884)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out311408884| ~a$w_buff1~0_In311408884) (not .cse1)))) InVars {~a~0=~a~0_In311408884, ~a$w_buff1~0=~a$w_buff1~0_In311408884, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In311408884, ~a$w_buff1_used~0=~a$w_buff1_used~0_In311408884} OutVars{~a~0=~a~0_In311408884, ~a$w_buff1~0=~a$w_buff1~0_In311408884, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out311408884|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In311408884, ~a$w_buff1_used~0=~a$w_buff1_used~0_In311408884} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 12:34:06,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L847-4-->L848: Formula: (= v_~a~0_44 |v_ULTIMATE.start_main_#t~ite47_19|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_19|} OutVars{~a~0=v_~a~0_44, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_18|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_16|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 12:34:06,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L848-->L848-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In1909047179 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In1909047179 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out1909047179| ~a$w_buff0_used~0_In1909047179) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out1909047179| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1909047179, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1909047179} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1909047179, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1909047179|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1909047179} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 12:34:06,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L849-->L849-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd0~0_In-935002756 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In-935002756 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd0~0_In-935002756 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-935002756 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-935002756|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-935002756 |ULTIMATE.start_main_#t~ite50_Out-935002756|) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-935002756, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-935002756, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-935002756, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-935002756} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-935002756|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-935002756, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-935002756, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-935002756, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-935002756} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 12:34:06,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L850-->L850-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1122537396 256))) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-1122537396 256) 0))) (or (and (= ~a$r_buff0_thd0~0_In-1122537396 |ULTIMATE.start_main_#t~ite51_Out-1122537396|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite51_Out-1122537396| 0) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1122537396, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1122537396} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1122537396|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1122537396, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1122537396} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 12:34:06,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L851-->L851-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In1809025617 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In1809025617 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In1809025617 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In1809025617 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out1809025617| ~a$r_buff1_thd0~0_In1809025617)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite52_Out1809025617| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1809025617, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1809025617, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1809025617, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1809025617} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1809025617|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1809025617, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1809025617, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1809025617, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1809025617} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 12:34:06,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] L851-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~a$r_buff1_thd0~0_125 |v_ULTIMATE.start_main_#t~ite52_55|) (= (mod v_~main$tmp_guard1~0_29 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|) (= v_~__unbuffered_p2_EBX~0_29 0) (= 0 v_~__unbuffered_p1_EAX~0_28) (= 1 v_~__unbuffered_p2_EAX~0_26) (= v_~__unbuffered_p0_EBX~0_85 0) (= v_~main$tmp_guard1~0_29 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_22 0) (= 1 v_~__unbuffered_p0_EAX~0_85)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_55|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_85, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_54|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_22, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_85, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_125, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:34:06,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:34:06 BasicIcfg [2019-12-18 12:34:06,932 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:34:06,933 INFO L168 Benchmark]: Toolchain (without parser) took 117003.72 ms. Allocated memory was 142.6 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 101.0 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 735.9 MB. Max. memory is 7.1 GB. [2019-12-18 12:34:06,934 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 142.6 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 12:34:06,934 INFO L168 Benchmark]: CACSL2BoogieTranslator took 866.53 ms. Allocated memory was 142.6 MB in the beginning and 203.9 MB in the end (delta: 61.3 MB). Free memory was 100.6 MB in the beginning and 156.7 MB in the end (delta: -56.2 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-18 12:34:06,934 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.74 ms. Allocated memory is still 203.9 MB. Free memory was 156.1 MB in the beginning and 153.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 12:34:06,935 INFO L168 Benchmark]: Boogie Preprocessor took 64.33 ms. Allocated memory is still 203.9 MB. Free memory was 153.5 MB in the beginning and 151.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 12:34:06,935 INFO L168 Benchmark]: RCFGBuilder took 922.58 ms. Allocated memory is still 203.9 MB. Free memory was 151.6 MB in the beginning and 100.5 MB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 7.1 GB. [2019-12-18 12:34:06,936 INFO L168 Benchmark]: TraceAbstraction took 115075.79 ms. Allocated memory was 203.9 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 100.5 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 674.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:34:06,938 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51 ms. Allocated memory is still 142.6 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 866.53 ms. Allocated memory was 142.6 MB in the beginning and 203.9 MB in the end (delta: 61.3 MB). Free memory was 100.6 MB in the beginning and 156.7 MB in the end (delta: -56.2 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.74 ms. Allocated memory is still 203.9 MB. Free memory was 156.1 MB in the beginning and 153.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.33 ms. Allocated memory is still 203.9 MB. Free memory was 153.5 MB in the beginning and 151.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 922.58 ms. Allocated memory is still 203.9 MB. Free memory was 151.6 MB in the beginning and 100.5 MB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 115075.79 ms. Allocated memory was 203.9 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 100.5 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 674.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 179 ProgramPointsBefore, 94 ProgramPointsAfterwards, 216 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 33 ChoiceCompositions, 7151 VarBasedMoverChecksPositive, 221 VarBasedMoverChecksNegative, 29 SemBasedMoverChecksPositive, 258 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 80759 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L837] FCALL, FORK 0 pthread_create(&t391, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t392, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L841] FCALL, FORK 0 pthread_create(&t393, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 a$w_buff1 = a$w_buff0 [L738] 1 a$w_buff0 = 1 [L739] 1 a$w_buff1_used = a$w_buff0_used [L740] 1 a$w_buff0_used = (_Bool)1 [L758] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L772] 2 y = 1 [L775] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L778] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L792] 3 z = 1 [L795] 3 __unbuffered_p2_EAX = z [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 a$flush_delayed = weak$$choice2 [L801] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L802] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L758] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L759] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L760] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L802] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L803] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L804] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L805] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L806] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L808] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L814] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L815] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L816] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L817] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L779] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L780] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L781] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L847] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L848] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L849] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L850] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 114.7s, OverallIterations: 41, TraceHistogramMax: 1, AutomataDifference: 40.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9171 SDtfs, 14384 SDslu, 32164 SDs, 0 SdLazy, 19058 SolverSat, 701 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 606 GetRequests, 75 SyntacticMatches, 19 SemanticMatches, 512 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2466 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156295occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 43.0s AutomataMinimizationTime, 40 MinimizatonAttempts, 246864 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 1957 NumberOfCodeBlocks, 1957 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1850 ConstructedInterpolants, 0 QuantifiedInterpolants, 406296 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 PerfectInterpolantSequences, 0/0 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...