/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix047_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 23:00:25,315 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 23:00:25,319 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 23:00:25,355 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 23:00:25,356 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 23:00:25,363 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 23:00:25,366 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 23:00:25,370 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 23:00:25,372 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 23:00:25,376 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 23:00:25,377 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 23:00:25,378 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 23:00:25,378 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 23:00:25,380 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 23:00:25,382 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 23:00:25,384 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 23:00:25,385 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 23:00:25,386 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 23:00:25,387 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 23:00:25,394 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 23:00:25,396 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 23:00:25,397 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 23:00:25,398 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 23:00:25,399 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 23:00:25,411 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 23:00:25,412 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 23:00:25,412 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 23:00:25,413 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 23:00:25,413 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 23:00:25,414 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 23:00:25,414 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 23:00:25,415 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 23:00:25,417 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 23:00:25,417 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 23:00:25,418 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 23:00:25,418 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 23:00:25,419 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 23:00:25,419 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 23:00:25,419 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 23:00:25,421 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 23:00:25,422 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 23:00:25,423 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-21 23:00:25,459 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 23:00:25,459 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 23:00:25,461 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 23:00:25,461 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 23:00:25,461 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 23:00:25,461 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 23:00:25,462 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 23:00:25,462 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 23:00:25,462 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 23:00:25,462 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 23:00:25,463 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 23:00:25,463 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 23:00:25,464 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 23:00:25,464 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 23:00:25,464 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 23:00:25,464 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 23:00:25,465 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 23:00:25,465 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 23:00:25,465 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 23:00:25,465 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 23:00:25,465 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 23:00:25,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 23:00:25,466 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 23:00:25,466 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-21 23:00:25,466 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 23:00:25,466 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 23:00:25,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 23:00:25,467 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-21 23:00:25,467 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 23:00:25,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 23:00:25,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 23:00:25,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 23:00:25,751 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 23:00:25,751 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 23:00:25,752 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_tso.opt.i [2020-10-21 23:00:25,813 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd8606337/94c05d61c5a14d21929036ee8cdfa532/FLAGcecd18333 [2020-10-21 23:00:26,279 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 23:00:26,280 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_tso.opt.i [2020-10-21 23:00:26,296 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd8606337/94c05d61c5a14d21929036ee8cdfa532/FLAGcecd18333 [2020-10-21 23:00:26,630 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd8606337/94c05d61c5a14d21929036ee8cdfa532 [2020-10-21 23:00:26,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 23:00:26,644 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 23:00:26,646 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 23:00:26,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 23:00:26,649 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 23:00:26,650 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:00:26" (1/1) ... [2020-10-21 23:00:26,653 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e1613d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:26, skipping insertion in model container [2020-10-21 23:00:26,653 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:00:26" (1/1) ... [2020-10-21 23:00:26,661 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 23:00:26,730 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 23:00:27,189 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:00:27,200 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 23:00:27,309 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:00:27,386 INFO L208 MainTranslator]: Completed translation [2020-10-21 23:00:27,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:27 WrapperNode [2020-10-21 23:00:27,387 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 23:00:27,388 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 23:00:27,388 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 23:00:27,388 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 23:00:27,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:27" (1/1) ... [2020-10-21 23:00:27,415 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:27" (1/1) ... [2020-10-21 23:00:27,453 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 23:00:27,453 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 23:00:27,453 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 23:00:27,455 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 23:00:27,465 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:27" (1/1) ... [2020-10-21 23:00:27,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:27" (1/1) ... [2020-10-21 23:00:27,471 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:27" (1/1) ... [2020-10-21 23:00:27,471 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:27" (1/1) ... [2020-10-21 23:00:27,482 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:27" (1/1) ... [2020-10-21 23:00:27,486 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:27" (1/1) ... [2020-10-21 23:00:27,490 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:27" (1/1) ... [2020-10-21 23:00:27,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 23:00:27,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 23:00:27,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 23:00:27,496 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 23:00:27,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:27" (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 [2020-10-21 23:00:27,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 23:00:27,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 23:00:27,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 23:00:27,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 23:00:27,566 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 23:00:27,566 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 23:00:27,567 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 23:00:27,567 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 23:00:27,567 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-21 23:00:27,567 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-21 23:00:27,568 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-21 23:00:27,568 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-21 23:00:27,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 23:00:27,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 23:00:27,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 23:00:27,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 23:00:27,571 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-21 23:00:29,390 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 23:00:29,391 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 23:00:29,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:00:29 BoogieIcfgContainer [2020-10-21 23:00:29,393 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 23:00:29,394 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 23:00:29,395 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 23:00:29,398 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 23:00:29,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 11:00:26" (1/3) ... [2020-10-21 23:00:29,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1275a7e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:00:29, skipping insertion in model container [2020-10-21 23:00:29,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:00:27" (2/3) ... [2020-10-21 23:00:29,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1275a7e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:00:29, skipping insertion in model container [2020-10-21 23:00:29,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:00:29" (3/3) ... [2020-10-21 23:00:29,401 INFO L111 eAbstractionObserver]: Analyzing ICFG mix047_tso.opt.i [2020-10-21 23:00:29,412 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 23:00:29,412 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-21 23:00:29,420 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 23:00:29,421 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 23:00:29,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,450 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,452 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,452 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,452 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,452 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,453 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,453 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,454 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,455 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,458 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,458 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,458 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,458 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,458 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,459 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,459 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,459 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,459 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,459 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,460 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,460 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,460 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,460 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,460 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,461 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,461 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,461 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,461 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,461 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,461 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,462 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,462 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,467 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,467 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,473 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,473 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,473 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,473 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,473 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,474 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,474 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,474 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,474 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,474 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,475 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,475 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,475 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,475 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,477 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,477 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,479 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,479 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:00:29,481 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 23:00:29,494 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-21 23:00:29,514 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 23:00:29,514 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 23:00:29,514 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-21 23:00:29,515 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 23:00:29,515 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 23:00:29,515 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 23:00:29,515 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 23:00:29,515 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 23:00:29,529 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-21 23:00:29,529 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 120 transitions, 260 flow [2020-10-21 23:00:29,532 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 120 transitions, 260 flow [2020-10-21 23:00:29,534 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 130 places, 120 transitions, 260 flow [2020-10-21 23:00:29,588 INFO L129 PetriNetUnfolder]: 3/116 cut-off events. [2020-10-21 23:00:29,588 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 23:00:29,594 INFO L80 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 3/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 95 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2020-10-21 23:00:29,598 INFO L116 LiptonReduction]: Number of co-enabled transitions 2830 [2020-10-21 23:00:30,101 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-10-21 23:00:31,116 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2020-10-21 23:00:32,074 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-10-21 23:00:32,608 WARN L193 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-10-21 23:00:32,781 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-21 23:00:32,802 INFO L131 LiptonReduction]: Checked pairs total: 8162 [2020-10-21 23:00:32,802 INFO L133 LiptonReduction]: Total number of compositions: 104 [2020-10-21 23:00:32,808 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 35 transitions, 90 flow [2020-10-21 23:00:33,093 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 4122 states. [2020-10-21 23:00:33,096 INFO L276 IsEmpty]: Start isEmpty. Operand 4122 states. [2020-10-21 23:00:33,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-21 23:00:33,104 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:33,105 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:33,105 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:33,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:33,112 INFO L82 PathProgramCache]: Analyzing trace with hash 284962156, now seen corresponding path program 1 times [2020-10-21 23:00:33,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:33,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641245996] [2020-10-21 23:00:33,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:33,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:00:33,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641245996] [2020-10-21 23:00:33,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:33,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:00:33,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618352026] [2020-10-21 23:00:33,407 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:00:33,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:33,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:00:33,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:00:33,425 INFO L87 Difference]: Start difference. First operand 4122 states. Second operand 3 states. [2020-10-21 23:00:33,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:33,543 INFO L93 Difference]: Finished difference Result 3562 states and 14032 transitions. [2020-10-21 23:00:33,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:00:33,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-21 23:00:33,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:33,594 INFO L225 Difference]: With dead ends: 3562 [2020-10-21 23:00:33,594 INFO L226 Difference]: Without dead ends: 2602 [2020-10-21 23:00:33,596 INFO L677 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 [2020-10-21 23:00:33,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2020-10-21 23:00:33,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2602. [2020-10-21 23:00:33,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2602 states. [2020-10-21 23:00:33,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 10064 transitions. [2020-10-21 23:00:33,775 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 10064 transitions. Word has length 9 [2020-10-21 23:00:33,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:33,776 INFO L481 AbstractCegarLoop]: Abstraction has 2602 states and 10064 transitions. [2020-10-21 23:00:33,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:00:33,776 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 10064 transitions. [2020-10-21 23:00:33,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 23:00:33,780 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:33,780 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:33,781 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 23:00:33,781 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:33,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:33,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1841214313, now seen corresponding path program 1 times [2020-10-21 23:00:33,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:33,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605759556] [2020-10-21 23:00:33,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:33,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:00:33,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605759556] [2020-10-21 23:00:33,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:33,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:00:33,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510953922] [2020-10-21 23:00:33,942 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:00:33,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:33,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:00:33,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:00:33,943 INFO L87 Difference]: Start difference. First operand 2602 states and 10064 transitions. Second operand 4 states. [2020-10-21 23:00:34,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:34,022 INFO L93 Difference]: Finished difference Result 2986 states and 11176 transitions. [2020-10-21 23:00:34,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:00:34,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-21 23:00:34,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:34,050 INFO L225 Difference]: With dead ends: 2986 [2020-10-21 23:00:34,050 INFO L226 Difference]: Without dead ends: 2506 [2020-10-21 23:00:34,051 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:00:34,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2020-10-21 23:00:34,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2506. [2020-10-21 23:00:34,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2020-10-21 23:00:34,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 9624 transitions. [2020-10-21 23:00:34,151 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 9624 transitions. Word has length 12 [2020-10-21 23:00:34,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:34,151 INFO L481 AbstractCegarLoop]: Abstraction has 2506 states and 9624 transitions. [2020-10-21 23:00:34,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:00:34,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 9624 transitions. [2020-10-21 23:00:34,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 23:00:34,155 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:34,155 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:34,155 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 23:00:34,156 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:34,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:34,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1244864964, now seen corresponding path program 1 times [2020-10-21 23:00:34,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:34,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693988137] [2020-10-21 23:00:34,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:34,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:00:34,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693988137] [2020-10-21 23:00:34,247 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:34,247 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:00:34,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529648715] [2020-10-21 23:00:34,248 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:00:34,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:34,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:00:34,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:00:34,249 INFO L87 Difference]: Start difference. First operand 2506 states and 9624 transitions. Second operand 4 states. [2020-10-21 23:00:34,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:34,317 INFO L93 Difference]: Finished difference Result 2794 states and 10416 transitions. [2020-10-21 23:00:34,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:00:34,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-21 23:00:34,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:34,338 INFO L225 Difference]: With dead ends: 2794 [2020-10-21 23:00:34,339 INFO L226 Difference]: Without dead ends: 2410 [2020-10-21 23:00:34,339 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:00:34,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2020-10-21 23:00:34,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2410. [2020-10-21 23:00:34,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2410 states. [2020-10-21 23:00:34,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 9184 transitions. [2020-10-21 23:00:34,503 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 9184 transitions. Word has length 13 [2020-10-21 23:00:34,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:34,503 INFO L481 AbstractCegarLoop]: Abstraction has 2410 states and 9184 transitions. [2020-10-21 23:00:34,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:00:34,503 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 9184 transitions. [2020-10-21 23:00:34,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 23:00:34,506 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:34,506 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:34,506 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 23:00:34,506 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:34,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:34,507 INFO L82 PathProgramCache]: Analyzing trace with hash 64021515, now seen corresponding path program 1 times [2020-10-21 23:00:34,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:34,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610848971] [2020-10-21 23:00:34,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:34,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:00:34,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610848971] [2020-10-21 23:00:34,589 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:34,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:00:34,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532616102] [2020-10-21 23:00:34,592 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:00:34,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:34,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:00:34,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:00:34,593 INFO L87 Difference]: Start difference. First operand 2410 states and 9184 transitions. Second operand 4 states. [2020-10-21 23:00:34,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:34,653 INFO L93 Difference]: Finished difference Result 2538 states and 9400 transitions. [2020-10-21 23:00:34,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:00:34,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-21 23:00:34,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:34,672 INFO L225 Difference]: With dead ends: 2538 [2020-10-21 23:00:34,672 INFO L226 Difference]: Without dead ends: 2154 [2020-10-21 23:00:34,672 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:00:34,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2020-10-21 23:00:34,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 2154. [2020-10-21 23:00:34,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2154 states. [2020-10-21 23:00:34,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 8112 transitions. [2020-10-21 23:00:34,752 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 8112 transitions. Word has length 14 [2020-10-21 23:00:34,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:34,752 INFO L481 AbstractCegarLoop]: Abstraction has 2154 states and 8112 transitions. [2020-10-21 23:00:34,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:00:34,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 8112 transitions. [2020-10-21 23:00:34,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:00:34,756 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:34,756 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:34,757 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 23:00:34,757 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:34,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:34,757 INFO L82 PathProgramCache]: Analyzing trace with hash -47248263, now seen corresponding path program 1 times [2020-10-21 23:00:34,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:34,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127787596] [2020-10-21 23:00:34,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:34,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:00:34,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127787596] [2020-10-21 23:00:34,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:34,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:00:34,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82014549] [2020-10-21 23:00:34,981 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:00:34,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:34,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:00:34,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:00:34,982 INFO L87 Difference]: Start difference. First operand 2154 states and 8112 transitions. Second operand 6 states. [2020-10-21 23:00:35,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:35,176 INFO L93 Difference]: Finished difference Result 2650 states and 9872 transitions. [2020-10-21 23:00:35,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:00:35,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-21 23:00:35,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:35,200 INFO L225 Difference]: With dead ends: 2650 [2020-10-21 23:00:35,200 INFO L226 Difference]: Without dead ends: 2394 [2020-10-21 23:00:35,201 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:00:35,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2394 states. [2020-10-21 23:00:35,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2394 to 2394. [2020-10-21 23:00:35,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2394 states. [2020-10-21 23:00:35,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2394 states and 9048 transitions. [2020-10-21 23:00:35,280 INFO L78 Accepts]: Start accepts. Automaton has 2394 states and 9048 transitions. Word has length 16 [2020-10-21 23:00:35,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:35,281 INFO L481 AbstractCegarLoop]: Abstraction has 2394 states and 9048 transitions. [2020-10-21 23:00:35,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:00:35,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 9048 transitions. [2020-10-21 23:00:35,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:00:35,285 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:35,285 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:35,285 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 23:00:35,286 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:35,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:35,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1387607219, now seen corresponding path program 2 times [2020-10-21 23:00:35,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:35,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511705479] [2020-10-21 23:00:35,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:35,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:00:35,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511705479] [2020-10-21 23:00:35,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:35,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:00:35,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392894741] [2020-10-21 23:00:35,419 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:00:35,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:35,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:00:35,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:00:35,420 INFO L87 Difference]: Start difference. First operand 2394 states and 9048 transitions. Second operand 6 states. [2020-10-21 23:00:35,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:35,637 INFO L93 Difference]: Finished difference Result 2506 states and 9240 transitions. [2020-10-21 23:00:35,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:00:35,637 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-21 23:00:35,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:35,668 INFO L225 Difference]: With dead ends: 2506 [2020-10-21 23:00:35,668 INFO L226 Difference]: Without dead ends: 2250 [2020-10-21 23:00:35,669 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:00:35,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2250 states. [2020-10-21 23:00:35,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2250 to 2010. [2020-10-21 23:00:35,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2010 states. [2020-10-21 23:00:35,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 7480 transitions. [2020-10-21 23:00:35,762 INFO L78 Accepts]: Start accepts. Automaton has 2010 states and 7480 transitions. Word has length 16 [2020-10-21 23:00:35,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:35,763 INFO L481 AbstractCegarLoop]: Abstraction has 2010 states and 7480 transitions. [2020-10-21 23:00:35,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:00:35,763 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 7480 transitions. [2020-10-21 23:00:35,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-21 23:00:35,770 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:35,770 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:35,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 23:00:35,770 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:35,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:35,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1349936792, now seen corresponding path program 1 times [2020-10-21 23:00:35,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:35,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071424750] [2020-10-21 23:00:35,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:36,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:00:36,072 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071424750] [2020-10-21 23:00:36,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:36,073 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 23:00:36,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875349889] [2020-10-21 23:00:36,073 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 23:00:36,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:36,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 23:00:36,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:00:36,074 INFO L87 Difference]: Start difference. First operand 2010 states and 7480 transitions. Second operand 8 states. [2020-10-21 23:00:36,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:36,243 INFO L93 Difference]: Finished difference Result 3094 states and 11274 transitions. [2020-10-21 23:00:36,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:00:36,243 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-10-21 23:00:36,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:36,255 INFO L225 Difference]: With dead ends: 3094 [2020-10-21 23:00:36,255 INFO L226 Difference]: Without dead ends: 2610 [2020-10-21 23:00:36,255 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:00:36,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2020-10-21 23:00:36,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2442. [2020-10-21 23:00:36,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2442 states. [2020-10-21 23:00:36,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 9040 transitions. [2020-10-21 23:00:36,330 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 9040 transitions. Word has length 18 [2020-10-21 23:00:36,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:36,331 INFO L481 AbstractCegarLoop]: Abstraction has 2442 states and 9040 transitions. [2020-10-21 23:00:36,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 23:00:36,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 9040 transitions. [2020-10-21 23:00:36,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-21 23:00:36,337 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:36,337 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:36,337 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 23:00:36,337 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:36,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:36,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1797912376, now seen corresponding path program 1 times [2020-10-21 23:00:36,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:36,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571035764] [2020-10-21 23:00:36,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:36,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:00:36,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571035764] [2020-10-21 23:00:36,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:36,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:00:36,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868249606] [2020-10-21 23:00:36,433 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:00:36,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:36,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:00:36,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:00:36,433 INFO L87 Difference]: Start difference. First operand 2442 states and 9040 transitions. Second operand 4 states. [2020-10-21 23:00:36,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:36,470 INFO L93 Difference]: Finished difference Result 2522 states and 8500 transitions. [2020-10-21 23:00:36,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:00:36,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-10-21 23:00:36,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:36,477 INFO L225 Difference]: With dead ends: 2522 [2020-10-21 23:00:36,478 INFO L226 Difference]: Without dead ends: 1898 [2020-10-21 23:00:36,478 INFO L677 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 [2020-10-21 23:00:36,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2020-10-21 23:00:36,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1898. [2020-10-21 23:00:36,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2020-10-21 23:00:36,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 6338 transitions. [2020-10-21 23:00:36,529 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 6338 transitions. Word has length 18 [2020-10-21 23:00:36,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:36,530 INFO L481 AbstractCegarLoop]: Abstraction has 1898 states and 6338 transitions. [2020-10-21 23:00:36,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:00:36,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 6338 transitions. [2020-10-21 23:00:36,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-21 23:00:36,534 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:36,535 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:36,535 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 23:00:36,535 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:36,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:36,535 INFO L82 PathProgramCache]: Analyzing trace with hash -682956174, now seen corresponding path program 1 times [2020-10-21 23:00:36,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:36,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42016639] [2020-10-21 23:00:36,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:36,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:00:36,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42016639] [2020-10-21 23:00:36,626 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:36,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:00:36,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011570707] [2020-10-21 23:00:36,627 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:00:36,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:36,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:00:36,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:00:36,628 INFO L87 Difference]: Start difference. First operand 1898 states and 6338 transitions. Second operand 5 states. [2020-10-21 23:00:36,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:36,683 INFO L93 Difference]: Finished difference Result 1602 states and 4889 transitions. [2020-10-21 23:00:36,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:00:36,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-10-21 23:00:36,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:36,688 INFO L225 Difference]: With dead ends: 1602 [2020-10-21 23:00:36,688 INFO L226 Difference]: Without dead ends: 1212 [2020-10-21 23:00:36,688 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:00:36,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2020-10-21 23:00:36,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1212. [2020-10-21 23:00:36,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1212 states. [2020-10-21 23:00:36,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 3624 transitions. [2020-10-21 23:00:36,718 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 3624 transitions. Word has length 19 [2020-10-21 23:00:36,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:36,718 INFO L481 AbstractCegarLoop]: Abstraction has 1212 states and 3624 transitions. [2020-10-21 23:00:36,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:00:36,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 3624 transitions. [2020-10-21 23:00:36,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-21 23:00:36,722 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:36,722 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:36,722 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 23:00:36,722 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:36,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:36,723 INFO L82 PathProgramCache]: Analyzing trace with hash -525600601, now seen corresponding path program 1 times [2020-10-21 23:00:36,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:36,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038835786] [2020-10-21 23:00:36,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:36,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:36,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:00:36,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038835786] [2020-10-21 23:00:36,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:36,797 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:00:36,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023238324] [2020-10-21 23:00:36,797 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:00:36,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:36,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:00:36,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:00:36,798 INFO L87 Difference]: Start difference. First operand 1212 states and 3624 transitions. Second operand 4 states. [2020-10-21 23:00:36,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:36,904 INFO L93 Difference]: Finished difference Result 1809 states and 5226 transitions. [2020-10-21 23:00:36,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:00:36,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-10-21 23:00:36,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:36,909 INFO L225 Difference]: With dead ends: 1809 [2020-10-21 23:00:36,909 INFO L226 Difference]: Without dead ends: 1240 [2020-10-21 23:00:36,909 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:00:36,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2020-10-21 23:00:36,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 1200. [2020-10-21 23:00:36,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1200 states. [2020-10-21 23:00:36,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 3396 transitions. [2020-10-21 23:00:36,937 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 3396 transitions. Word has length 20 [2020-10-21 23:00:36,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:36,937 INFO L481 AbstractCegarLoop]: Abstraction has 1200 states and 3396 transitions. [2020-10-21 23:00:36,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:00:36,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 3396 transitions. [2020-10-21 23:00:36,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-21 23:00:36,940 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:36,941 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:36,941 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 23:00:36,941 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:36,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:36,941 INFO L82 PathProgramCache]: Analyzing trace with hash 905378528, now seen corresponding path program 1 times [2020-10-21 23:00:36,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:36,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202789079] [2020-10-21 23:00:36,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:37,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:00:37,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202789079] [2020-10-21 23:00:37,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:37,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:00:37,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458809371] [2020-10-21 23:00:37,009 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:00:37,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:37,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:00:37,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:00:37,010 INFO L87 Difference]: Start difference. First operand 1200 states and 3396 transitions. Second operand 4 states. [2020-10-21 23:00:37,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:37,046 INFO L93 Difference]: Finished difference Result 1753 states and 4749 transitions. [2020-10-21 23:00:37,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:00:37,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-10-21 23:00:37,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:37,049 INFO L225 Difference]: With dead ends: 1753 [2020-10-21 23:00:37,050 INFO L226 Difference]: Without dead ends: 1216 [2020-10-21 23:00:37,050 INFO L677 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 [2020-10-21 23:00:37,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2020-10-21 23:00:37,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1162. [2020-10-21 23:00:37,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1162 states. [2020-10-21 23:00:37,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 3114 transitions. [2020-10-21 23:00:37,076 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 3114 transitions. Word has length 21 [2020-10-21 23:00:37,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:37,076 INFO L481 AbstractCegarLoop]: Abstraction has 1162 states and 3114 transitions. [2020-10-21 23:00:37,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:00:37,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 3114 transitions. [2020-10-21 23:00:37,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-21 23:00:37,079 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:37,079 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:37,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-21 23:00:37,080 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:37,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:37,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1527121136, now seen corresponding path program 1 times [2020-10-21 23:00:37,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:37,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658544348] [2020-10-21 23:00:37,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:37,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:37,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:00:37,169 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658544348] [2020-10-21 23:00:37,169 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:37,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:00:37,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007550237] [2020-10-21 23:00:37,170 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:00:37,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:37,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:00:37,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:00:37,171 INFO L87 Difference]: Start difference. First operand 1162 states and 3114 transitions. Second operand 6 states. [2020-10-21 23:00:37,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:37,241 INFO L93 Difference]: Finished difference Result 992 states and 2597 transitions. [2020-10-21 23:00:37,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:00:37,242 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-21 23:00:37,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:37,244 INFO L225 Difference]: With dead ends: 992 [2020-10-21 23:00:37,245 INFO L226 Difference]: Without dead ends: 774 [2020-10-21 23:00:37,245 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:00:37,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2020-10-21 23:00:37,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 684. [2020-10-21 23:00:37,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2020-10-21 23:00:37,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1750 transitions. [2020-10-21 23:00:37,264 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1750 transitions. Word has length 21 [2020-10-21 23:00:37,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:37,264 INFO L481 AbstractCegarLoop]: Abstraction has 684 states and 1750 transitions. [2020-10-21 23:00:37,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:00:37,264 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1750 transitions. [2020-10-21 23:00:37,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-21 23:00:37,269 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:37,270 INFO L422 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] [2020-10-21 23:00:37,270 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-21 23:00:37,270 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:37,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:37,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1198049199, now seen corresponding path program 1 times [2020-10-21 23:00:37,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:37,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17092494] [2020-10-21 23:00:37,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:37,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:00:37,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17092494] [2020-10-21 23:00:37,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:37,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:00:37,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059846890] [2020-10-21 23:00:37,404 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:00:37,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:37,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:00:37,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:00:37,405 INFO L87 Difference]: Start difference. First operand 684 states and 1750 transitions. Second operand 5 states. [2020-10-21 23:00:37,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:37,453 INFO L93 Difference]: Finished difference Result 870 states and 2144 transitions. [2020-10-21 23:00:37,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:00:37,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-10-21 23:00:37,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:37,456 INFO L225 Difference]: With dead ends: 870 [2020-10-21 23:00:37,456 INFO L226 Difference]: Without dead ends: 459 [2020-10-21 23:00:37,456 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:00:37,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2020-10-21 23:00:37,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 455. [2020-10-21 23:00:37,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2020-10-21 23:00:37,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1017 transitions. [2020-10-21 23:00:37,469 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 1017 transitions. Word has length 24 [2020-10-21 23:00:37,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:37,470 INFO L481 AbstractCegarLoop]: Abstraction has 455 states and 1017 transitions. [2020-10-21 23:00:37,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:00:37,470 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 1017 transitions. [2020-10-21 23:00:37,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-21 23:00:37,473 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:37,473 INFO L422 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] [2020-10-21 23:00:37,473 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-21 23:00:37,474 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:37,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:37,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1202140058, now seen corresponding path program 1 times [2020-10-21 23:00:37,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:37,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536712831] [2020-10-21 23:00:37,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:37,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:37,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:00:37,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536712831] [2020-10-21 23:00:37,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:37,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 23:00:37,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091650084] [2020-10-21 23:00:37,705 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 23:00:37,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:37,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 23:00:37,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:00:37,706 INFO L87 Difference]: Start difference. First operand 455 states and 1017 transitions. Second operand 8 states. [2020-10-21 23:00:37,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:37,820 INFO L93 Difference]: Finished difference Result 527 states and 1175 transitions. [2020-10-21 23:00:37,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:00:37,820 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-10-21 23:00:37,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:37,822 INFO L225 Difference]: With dead ends: 527 [2020-10-21 23:00:37,822 INFO L226 Difference]: Without dead ends: 495 [2020-10-21 23:00:37,823 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:00:37,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2020-10-21 23:00:37,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 447. [2020-10-21 23:00:37,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2020-10-21 23:00:37,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 993 transitions. [2020-10-21 23:00:37,833 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 993 transitions. Word has length 24 [2020-10-21 23:00:37,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:37,833 INFO L481 AbstractCegarLoop]: Abstraction has 447 states and 993 transitions. [2020-10-21 23:00:37,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 23:00:37,834 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 993 transitions. [2020-10-21 23:00:37,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-21 23:00:37,835 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:37,835 INFO L422 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] [2020-10-21 23:00:37,835 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-21 23:00:37,835 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:37,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:37,836 INFO L82 PathProgramCache]: Analyzing trace with hash 512739638, now seen corresponding path program 2 times [2020-10-21 23:00:37,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:37,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468134526] [2020-10-21 23:00:37,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:38,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:00:38,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468134526] [2020-10-21 23:00:38,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:38,050 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 23:00:38,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48357555] [2020-10-21 23:00:38,050 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 23:00:38,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:38,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 23:00:38,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:00:38,051 INFO L87 Difference]: Start difference. First operand 447 states and 993 transitions. Second operand 8 states. [2020-10-21 23:00:38,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:38,207 INFO L93 Difference]: Finished difference Result 501 states and 1114 transitions. [2020-10-21 23:00:38,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:00:38,207 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-10-21 23:00:38,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:38,210 INFO L225 Difference]: With dead ends: 501 [2020-10-21 23:00:38,210 INFO L226 Difference]: Without dead ends: 477 [2020-10-21 23:00:38,210 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:00:38,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2020-10-21 23:00:38,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 429. [2020-10-21 23:00:38,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2020-10-21 23:00:38,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 947 transitions. [2020-10-21 23:00:38,222 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 947 transitions. Word has length 24 [2020-10-21 23:00:38,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:38,222 INFO L481 AbstractCegarLoop]: Abstraction has 429 states and 947 transitions. [2020-10-21 23:00:38,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 23:00:38,222 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 947 transitions. [2020-10-21 23:00:38,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-21 23:00:38,223 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:38,224 INFO L422 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] [2020-10-21 23:00:38,224 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-21 23:00:38,224 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:38,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:38,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1886708776, now seen corresponding path program 3 times [2020-10-21 23:00:38,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:38,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648936157] [2020-10-21 23:00:38,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:38,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:00:38,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648936157] [2020-10-21 23:00:38,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:38,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 23:00:38,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330409150] [2020-10-21 23:00:38,556 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 23:00:38,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:38,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 23:00:38,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:00:38,557 INFO L87 Difference]: Start difference. First operand 429 states and 947 transitions. Second operand 8 states. [2020-10-21 23:00:38,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:38,856 INFO L93 Difference]: Finished difference Result 477 states and 1060 transitions. [2020-10-21 23:00:38,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:00:38,857 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-10-21 23:00:38,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:38,858 INFO L225 Difference]: With dead ends: 477 [2020-10-21 23:00:38,858 INFO L226 Difference]: Without dead ends: 370 [2020-10-21 23:00:38,858 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-10-21 23:00:38,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2020-10-21 23:00:38,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 322. [2020-10-21 23:00:38,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2020-10-21 23:00:38,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 700 transitions. [2020-10-21 23:00:38,867 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 700 transitions. Word has length 24 [2020-10-21 23:00:38,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:38,867 INFO L481 AbstractCegarLoop]: Abstraction has 322 states and 700 transitions. [2020-10-21 23:00:38,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 23:00:38,867 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 700 transitions. [2020-10-21 23:00:38,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-21 23:00:38,868 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:38,868 INFO L422 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] [2020-10-21 23:00:38,869 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-21 23:00:38,869 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:38,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:38,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1018346385, now seen corresponding path program 2 times [2020-10-21 23:00:38,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:38,870 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773096752] [2020-10-21 23:00:38,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:38,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:00:38,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773096752] [2020-10-21 23:00:38,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:38,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 23:00:38,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004908371] [2020-10-21 23:00:38,949 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:00:38,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:38,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:00:38,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:00:38,950 INFO L87 Difference]: Start difference. First operand 322 states and 700 transitions. Second operand 7 states. [2020-10-21 23:00:39,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:39,022 INFO L93 Difference]: Finished difference Result 293 states and 643 transitions. [2020-10-21 23:00:39,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:00:39,023 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-21 23:00:39,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:39,024 INFO L225 Difference]: With dead ends: 293 [2020-10-21 23:00:39,024 INFO L226 Difference]: Without dead ends: 65 [2020-10-21 23:00:39,024 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-10-21 23:00:39,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-10-21 23:00:39,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-10-21 23:00:39,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-10-21 23:00:39,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 123 transitions. [2020-10-21 23:00:39,026 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 123 transitions. Word has length 24 [2020-10-21 23:00:39,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:39,027 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 123 transitions. [2020-10-21 23:00:39,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:00:39,027 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 123 transitions. [2020-10-21 23:00:39,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-21 23:00:39,027 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:39,027 INFO L422 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] [2020-10-21 23:00:39,028 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-21 23:00:39,028 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:39,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:39,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1677699125, now seen corresponding path program 1 times [2020-10-21 23:00:39,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:39,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373025728] [2020-10-21 23:00:39,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:00:39,064 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:00:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:00:39,098 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:00:39,137 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 23:00:39,137 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 23:00:39,137 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-21 23:00:39,169 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:39,169 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:39,170 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:39,170 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [799] [2020-10-21 23:00:39,172 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:39,172 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:39,173 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:39,173 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:39,173 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:39,173 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:39,173 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:39,173 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:39,174 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:39,174 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:39,174 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:39,174 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:39,175 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:39,175 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:39,175 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:39,175 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:39,175 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:39,175 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:39,176 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:39,176 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:39,176 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:39,176 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:39,176 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:39,176 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:39,177 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:39,177 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:39,177 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:39,177 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:39,178 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:39,178 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:39,178 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:39,178 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:39,178 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:39,178 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:39,179 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:39,179 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:39,179 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:39,179 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:39,179 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:39,180 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:39,180 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:39,180 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:39,180 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:39,180 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:39,180 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:39,181 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:39,181 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:39,181 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:39,181 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:39,181 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:39,181 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:39,182 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:39,182 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:39,182 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:39,182 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:39,182 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:39,182 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:39,182 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:39,183 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:39,183 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:39,183 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 23:00:39,183 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:39,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 11:00:39 BasicIcfg [2020-10-21 23:00:39,269 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 23:00:39,270 INFO L168 Benchmark]: Toolchain (without parser) took 12631.34 ms. Allocated memory was 139.5 MB in the beginning and 478.7 MB in the end (delta: 339.2 MB). Free memory was 101.0 MB in the beginning and 237.1 MB in the end (delta: -136.0 MB). Peak memory consumption was 203.2 MB. Max. memory is 7.1 GB. [2020-10-21 23:00:39,271 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-21 23:00:39,271 INFO L168 Benchmark]: CACSL2BoogieTranslator took 741.98 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 100.2 MB in the beginning and 152.8 MB in the end (delta: -52.6 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. [2020-10-21 23:00:39,272 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.09 ms. Allocated memory is still 202.4 MB. Free memory was 152.8 MB in the beginning and 149.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2020-10-21 23:00:39,273 INFO L168 Benchmark]: Boogie Preprocessor took 41.83 ms. Allocated memory is still 202.4 MB. Free memory was 149.4 MB in the beginning and 146.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-21 23:00:39,273 INFO L168 Benchmark]: RCFGBuilder took 1897.73 ms. Allocated memory was 202.4 MB in the beginning and 248.5 MB in the end (delta: 46.1 MB). Free memory was 146.7 MB in the beginning and 182.2 MB in the end (delta: -35.6 MB). Peak memory consumption was 101.0 MB. Max. memory is 7.1 GB. [2020-10-21 23:00:39,274 INFO L168 Benchmark]: TraceAbstraction took 9874.21 ms. Allocated memory was 248.5 MB in the beginning and 478.7 MB in the end (delta: 230.2 MB). Free memory was 180.4 MB in the beginning and 237.1 MB in the end (delta: -56.7 MB). Peak memory consumption was 173.5 MB. Max. memory is 7.1 GB. [2020-10-21 23:00:39,277 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 741.98 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 100.2 MB in the beginning and 152.8 MB in the end (delta: -52.6 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.09 ms. Allocated memory is still 202.4 MB. Free memory was 152.8 MB in the beginning and 149.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.83 ms. Allocated memory is still 202.4 MB. Free memory was 149.4 MB in the beginning and 146.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1897.73 ms. Allocated memory was 202.4 MB in the beginning and 248.5 MB in the end (delta: 46.1 MB). Free memory was 146.7 MB in the beginning and 182.2 MB in the end (delta: -35.6 MB). Peak memory consumption was 101.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9874.21 ms. Allocated memory was 248.5 MB in the beginning and 478.7 MB in the end (delta: 230.2 MB). Free memory was 180.4 MB in the beginning and 237.1 MB in the end (delta: -56.7 MB). Peak memory consumption was 173.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1512 VarBasedMoverChecksPositive, 28 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 148 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.2s, 130 PlacesBefore, 47 PlacesAfterwards, 120 TransitionsBefore, 35 TransitionsAfterwards, 2830 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 104 TotalNumberOfCompositions, 8162 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L718] 0 int b = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1277; [L845] FCALL, FORK 0 pthread_create(&t1277, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 pthread_t t1278; [L847] FCALL, FORK 0 pthread_create(&t1278, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1279; [L849] FCALL, FORK 0 pthread_create(&t1279, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1280; [L851] FCALL, FORK 0 pthread_create(&t1280, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 2 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L18] COND TRUE 4 !expression [L17] COND FALSE 4 !(0) [L17] 4 __assert_fail ("0", "mix047_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) [L805] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L810] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] 4 a = 1 [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L765] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L780] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L786] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L786] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L787] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L789] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L790] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L793] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 3 return 0; [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L822] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 z$flush_delayed = weak$$choice2 [L867] 0 z$mem_tmp = z [L868] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L868] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1 [L868] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L868] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L869] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L869] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L869] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L869] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L870] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L870] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L870] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L870] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L871] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L871] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L873] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L873] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L873] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L873] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L874] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L874] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L876] 0 z = z$flush_delayed ? z$mem_tmp : z [L877] 0 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix047_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 118 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.6s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 645 SDtfs, 880 SDslu, 1413 SDs, 0 SdLazy, 459 SolverSat, 153 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4122occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 740 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 344 NumberOfCodeBlocks, 344 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 49250 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...