./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ntdrivers-simplified/floppy_simpl3_false-unreach-call_true-valid-memsafety_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ntdrivers-simplified/floppy_simpl3_false-unreach-call_true-valid-memsafety_true-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 600447986a0d0a3d94421aa90c6997a7dd1eb35a ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 16:03:53,942 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 16:03:53,945 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 16:03:53,959 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 16:03:53,959 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 16:03:53,960 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 16:03:53,962 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 16:03:53,964 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 16:03:53,966 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 16:03:53,967 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 16:03:53,968 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 16:03:53,969 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 16:03:53,970 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 16:03:53,971 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 16:03:53,972 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 16:03:53,973 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 16:03:53,974 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 16:03:53,976 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 16:03:53,979 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 16:03:53,981 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 16:03:53,982 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 16:03:53,984 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 16:03:53,987 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 16:03:53,987 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 16:03:53,987 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 16:03:53,989 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 16:03:53,990 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 16:03:53,991 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 16:03:53,992 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 16:03:53,993 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 16:03:53,993 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 16:03:53,994 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 16:03:53,994 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 16:03:53,995 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 16:03:53,996 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 16:03:53,997 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 16:03:53,998 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 16:03:54,013 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 16:03:54,014 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 16:03:54,015 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 16:03:54,015 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 16:03:54,016 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 16:03:54,016 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 16:03:54,016 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 16:03:54,016 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 16:03:54,016 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 16:03:54,017 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 16:03:54,017 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 16:03:54,017 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 16:03:54,017 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 16:03:54,017 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 16:03:54,017 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 16:03:54,018 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 16:03:54,018 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 16:03:54,018 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 16:03:54,018 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 16:03:54,018 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 16:03:54,020 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 16:03:54,020 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 16:03:54,021 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 16:03:54,021 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 16:03:54,021 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 16:03:54,021 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 16:03:54,021 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 16:03:54,022 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 16:03:54,022 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 600447986a0d0a3d94421aa90c6997a7dd1eb35a [2018-12-30 16:03:54,066 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 16:03:54,080 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 16:03:54,085 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 16:03:54,086 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 16:03:54,087 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 16:03:54,088 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ntdrivers-simplified/floppy_simpl3_false-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-30 16:03:54,152 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68df04720/190fec80380c44d6b57cd69e6bcf9d52/FLAG3c3f48bba [2018-12-30 16:03:54,649 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 16:03:54,650 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ntdrivers-simplified/floppy_simpl3_false-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-30 16:03:54,665 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68df04720/190fec80380c44d6b57cd69e6bcf9d52/FLAG3c3f48bba [2018-12-30 16:03:54,968 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68df04720/190fec80380c44d6b57cd69e6bcf9d52 [2018-12-30 16:03:54,973 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 16:03:54,975 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 16:03:54,976 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 16:03:54,976 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 16:03:54,980 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 16:03:54,981 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:03:54" (1/1) ... [2018-12-30 16:03:54,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@127f5ab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:03:54, skipping insertion in model container [2018-12-30 16:03:54,985 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:03:54" (1/1) ... [2018-12-30 16:03:54,994 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 16:03:55,065 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 16:03:55,479 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:03:55,486 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 16:03:55,579 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:03:55,607 INFO L195 MainTranslator]: Completed translation [2018-12-30 16:03:55,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:03:55 WrapperNode [2018-12-30 16:03:55,608 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 16:03:55,609 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 16:03:55,609 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 16:03:55,610 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 16:03:55,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:03:55" (1/1) ... [2018-12-30 16:03:55,724 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:03:55" (1/1) ... [2018-12-30 16:03:55,833 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 16:03:55,834 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 16:03:55,834 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 16:03:55,834 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 16:03:55,847 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:03:55" (1/1) ... [2018-12-30 16:03:55,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:03:55" (1/1) ... [2018-12-30 16:03:55,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:03:55" (1/1) ... [2018-12-30 16:03:55,855 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:03:55" (1/1) ... [2018-12-30 16:03:55,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:03:55" (1/1) ... [2018-12-30 16:03:55,913 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:03:55" (1/1) ... [2018-12-30 16:03:55,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:03:55" (1/1) ... [2018-12-30 16:03:55,949 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 16:03:55,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 16:03:55,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 16:03:55,952 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 16:03:55,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:03:55" (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 [2018-12-30 16:03:56,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 16:03:56,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 16:03:56,501 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:03:56,501 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:03:56,514 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:03:56,517 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:03:56,529 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:03:56,532 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:03:56,542 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:03:56,542 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:03:56,546 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:03:56,546 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:03:56,551 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:03:56,554 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:03:56,560 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:03:56,560 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:03:56,566 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:03:56,566 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:03:56,568 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:03:56,568 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:03:56,571 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:03:56,573 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:03:56,577 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:03:56,577 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:03:56,580 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:03:56,581 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:03:56,582 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:03:56,582 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:03:56,582 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:03:56,583 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:03:56,585 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:03:56,586 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:03:56,590 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:03:56,591 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:03:56,595 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:03:56,595 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:03:56,599 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:03:56,599 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:03:56,602 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:03:56,602 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:03:56,605 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:03:56,605 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:03:56,608 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:03:56,609 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:03:56,610 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:03:56,610 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:03:56,611 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:03:56,611 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:03:56,614 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-30 16:03:56,615 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-30 16:03:59,314 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 16:03:59,314 INFO L280 CfgBuilder]: Removed 207 assue(true) statements. [2018-12-30 16:03:59,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:03:59 BoogieIcfgContainer [2018-12-30 16:03:59,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 16:03:59,316 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 16:03:59,316 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 16:03:59,320 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 16:03:59,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 04:03:54" (1/3) ... [2018-12-30 16:03:59,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1a44be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:03:59, skipping insertion in model container [2018-12-30 16:03:59,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:03:55" (2/3) ... [2018-12-30 16:03:59,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1a44be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:03:59, skipping insertion in model container [2018-12-30 16:03:59,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:03:59" (3/3) ... [2018-12-30 16:03:59,324 INFO L112 eAbstractionObserver]: Analyzing ICFG floppy_simpl3_false-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-30 16:03:59,335 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 16:03:59,345 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-12-30 16:03:59,364 INFO L257 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2018-12-30 16:03:59,415 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 16:03:59,416 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 16:03:59,416 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 16:03:59,416 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 16:03:59,416 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 16:03:59,416 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 16:03:59,417 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 16:03:59,417 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 16:03:59,417 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 16:03:59,451 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states. [2018-12-30 16:03:59,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-30 16:03:59,458 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:03:59,459 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:03:59,463 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:03:59,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:03:59,472 INFO L82 PathProgramCache]: Analyzing trace with hash 660910296, now seen corresponding path program 1 times [2018-12-30 16:03:59,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:03:59,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:03:59,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:03:59,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:03:59,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:03:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:03:59,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:03:59,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:03:59,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:03:59,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:03:59,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:03:59,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:03:59,699 INFO L87 Difference]: Start difference. First operand 421 states. Second operand 3 states. [2018-12-30 16:03:59,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:03:59,939 INFO L93 Difference]: Finished difference Result 763 states and 1090 transitions. [2018-12-30 16:03:59,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:03:59,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-30 16:03:59,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:03:59,962 INFO L225 Difference]: With dead ends: 763 [2018-12-30 16:03:59,962 INFO L226 Difference]: Without dead ends: 416 [2018-12-30 16:03:59,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:03:59,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2018-12-30 16:04:00,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2018-12-30 16:04:00,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-12-30 16:04:00,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 546 transitions. [2018-12-30 16:04:00,079 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 546 transitions. Word has length 11 [2018-12-30 16:04:00,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:00,080 INFO L480 AbstractCegarLoop]: Abstraction has 416 states and 546 transitions. [2018-12-30 16:04:00,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:04:00,080 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 546 transitions. [2018-12-30 16:04:00,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-30 16:04:00,082 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:00,083 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:04:00,085 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:00,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:00,087 INFO L82 PathProgramCache]: Analyzing trace with hash -32433196, now seen corresponding path program 1 times [2018-12-30 16:04:00,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:00,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:00,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:00,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:00,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:00,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:00,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:00,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:00,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:04:00,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:04:00,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:04:00,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:00,284 INFO L87 Difference]: Start difference. First operand 416 states and 546 transitions. Second operand 3 states. [2018-12-30 16:04:01,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:01,012 INFO L93 Difference]: Finished difference Result 714 states and 941 transitions. [2018-12-30 16:04:01,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:04:01,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-30 16:04:01,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:01,018 INFO L225 Difference]: With dead ends: 714 [2018-12-30 16:04:01,019 INFO L226 Difference]: Without dead ends: 547 [2018-12-30 16:04:01,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:01,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-12-30 16:04:01,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 521. [2018-12-30 16:04:01,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-12-30 16:04:01,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 697 transitions. [2018-12-30 16:04:01,062 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 697 transitions. Word has length 13 [2018-12-30 16:04:01,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:01,063 INFO L480 AbstractCegarLoop]: Abstraction has 521 states and 697 transitions. [2018-12-30 16:04:01,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:04:01,063 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 697 transitions. [2018-12-30 16:04:01,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-30 16:04:01,065 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:01,065 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:04:01,066 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:01,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:01,068 INFO L82 PathProgramCache]: Analyzing trace with hash 563627937, now seen corresponding path program 1 times [2018-12-30 16:04:01,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:01,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:01,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:01,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:01,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:01,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:01,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:01,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:01,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:04:01,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:04:01,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:04:01,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:01,190 INFO L87 Difference]: Start difference. First operand 521 states and 697 transitions. Second operand 3 states. [2018-12-30 16:04:01,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:01,425 INFO L93 Difference]: Finished difference Result 1000 states and 1335 transitions. [2018-12-30 16:04:01,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:04:01,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-30 16:04:01,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:01,431 INFO L225 Difference]: With dead ends: 1000 [2018-12-30 16:04:01,431 INFO L226 Difference]: Without dead ends: 690 [2018-12-30 16:04:01,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:01,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2018-12-30 16:04:01,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 519. [2018-12-30 16:04:01,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2018-12-30 16:04:01,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 696 transitions. [2018-12-30 16:04:01,483 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 696 transitions. Word has length 16 [2018-12-30 16:04:01,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:01,483 INFO L480 AbstractCegarLoop]: Abstraction has 519 states and 696 transitions. [2018-12-30 16:04:01,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:04:01,483 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 696 transitions. [2018-12-30 16:04:01,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-30 16:04:01,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:01,485 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:04:01,486 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:01,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:01,488 INFO L82 PathProgramCache]: Analyzing trace with hash 6806604, now seen corresponding path program 1 times [2018-12-30 16:04:01,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:01,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:01,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:01,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:01,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:01,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:01,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:01,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:01,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:04:01,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:04:01,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:04:01,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:01,634 INFO L87 Difference]: Start difference. First operand 519 states and 696 transitions. Second operand 3 states. [2018-12-30 16:04:01,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:01,868 INFO L93 Difference]: Finished difference Result 601 states and 797 transitions. [2018-12-30 16:04:01,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:04:01,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-30 16:04:01,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:01,873 INFO L225 Difference]: With dead ends: 601 [2018-12-30 16:04:01,873 INFO L226 Difference]: Without dead ends: 578 [2018-12-30 16:04:01,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:01,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2018-12-30 16:04:01,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 537. [2018-12-30 16:04:01,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-12-30 16:04:01,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 727 transitions. [2018-12-30 16:04:01,916 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 727 transitions. Word has length 19 [2018-12-30 16:04:01,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:01,916 INFO L480 AbstractCegarLoop]: Abstraction has 537 states and 727 transitions. [2018-12-30 16:04:01,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:04:01,917 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 727 transitions. [2018-12-30 16:04:01,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-30 16:04:01,920 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:01,920 INFO L402 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] [2018-12-30 16:04:01,922 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:01,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:01,922 INFO L82 PathProgramCache]: Analyzing trace with hash -450647822, now seen corresponding path program 1 times [2018-12-30 16:04:01,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:01,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:01,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:01,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:01,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:02,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:02,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:02,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:04:02,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:04:02,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:04:02,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:02,033 INFO L87 Difference]: Start difference. First operand 537 states and 727 transitions. Second operand 3 states. [2018-12-30 16:04:03,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:03,448 INFO L93 Difference]: Finished difference Result 732 states and 987 transitions. [2018-12-30 16:04:03,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:04:03,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-30 16:04:03,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:03,454 INFO L225 Difference]: With dead ends: 732 [2018-12-30 16:04:03,454 INFO L226 Difference]: Without dead ends: 724 [2018-12-30 16:04:03,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:03,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2018-12-30 16:04:03,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 555. [2018-12-30 16:04:03,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-12-30 16:04:03,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 754 transitions. [2018-12-30 16:04:03,494 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 754 transitions. Word has length 22 [2018-12-30 16:04:03,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:03,495 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 754 transitions. [2018-12-30 16:04:03,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:04:03,495 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 754 transitions. [2018-12-30 16:04:03,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-30 16:04:03,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:03,502 INFO L402 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] [2018-12-30 16:04:03,503 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:03,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:03,510 INFO L82 PathProgramCache]: Analyzing trace with hash 364241657, now seen corresponding path program 1 times [2018-12-30 16:04:03,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:03,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:03,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:03,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:03,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:03,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:03,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:03,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:04:03,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:04:03,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:04:03,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:03,621 INFO L87 Difference]: Start difference. First operand 555 states and 754 transitions. Second operand 3 states. [2018-12-30 16:04:04,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:04,922 INFO L93 Difference]: Finished difference Result 590 states and 798 transitions. [2018-12-30 16:04:04,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:04:04,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-30 16:04:04,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:04,928 INFO L225 Difference]: With dead ends: 590 [2018-12-30 16:04:04,929 INFO L226 Difference]: Without dead ends: 585 [2018-12-30 16:04:04,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:04,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2018-12-30 16:04:04,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 582. [2018-12-30 16:04:04,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2018-12-30 16:04:04,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 790 transitions. [2018-12-30 16:04:04,972 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 790 transitions. Word has length 22 [2018-12-30 16:04:04,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:04,972 INFO L480 AbstractCegarLoop]: Abstraction has 582 states and 790 transitions. [2018-12-30 16:04:04,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:04:04,972 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 790 transitions. [2018-12-30 16:04:04,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-30 16:04:04,978 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:04,978 INFO L402 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] [2018-12-30 16:04:04,981 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:04,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:04,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1092839096, now seen corresponding path program 1 times [2018-12-30 16:04:04,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:04,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:04,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:04,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:04,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:05,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:05,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:05,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:05,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 16:04:05,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 16:04:05,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 16:04:05,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:04:05,179 INFO L87 Difference]: Start difference. First operand 582 states and 790 transitions. Second operand 4 states. [2018-12-30 16:04:07,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:07,174 INFO L93 Difference]: Finished difference Result 884 states and 1178 transitions. [2018-12-30 16:04:07,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 16:04:07,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-12-30 16:04:07,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:07,180 INFO L225 Difference]: With dead ends: 884 [2018-12-30 16:04:07,181 INFO L226 Difference]: Without dead ends: 623 [2018-12-30 16:04:07,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:04:07,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2018-12-30 16:04:07,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 565. [2018-12-30 16:04:07,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2018-12-30 16:04:07,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 754 transitions. [2018-12-30 16:04:07,225 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 754 transitions. Word has length 23 [2018-12-30 16:04:07,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:07,226 INFO L480 AbstractCegarLoop]: Abstraction has 565 states and 754 transitions. [2018-12-30 16:04:07,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 16:04:07,226 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 754 transitions. [2018-12-30 16:04:07,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-30 16:04:07,227 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:07,227 INFO L402 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] [2018-12-30 16:04:07,230 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:07,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:07,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1575831316, now seen corresponding path program 1 times [2018-12-30 16:04:07,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:07,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:07,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:07,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:07,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:07,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:07,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:07,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 16:04:07,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 16:04:07,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 16:04:07,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:04:07,319 INFO L87 Difference]: Start difference. First operand 565 states and 754 transitions. Second operand 4 states. [2018-12-30 16:04:07,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:07,452 INFO L93 Difference]: Finished difference Result 578 states and 768 transitions. [2018-12-30 16:04:07,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 16:04:07,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-12-30 16:04:07,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:07,458 INFO L225 Difference]: With dead ends: 578 [2018-12-30 16:04:07,458 INFO L226 Difference]: Without dead ends: 563 [2018-12-30 16:04:07,459 INFO L631 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 [2018-12-30 16:04:07,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2018-12-30 16:04:07,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2018-12-30 16:04:07,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-12-30 16:04:07,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 751 transitions. [2018-12-30 16:04:07,498 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 751 transitions. Word has length 23 [2018-12-30 16:04:07,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:07,498 INFO L480 AbstractCegarLoop]: Abstraction has 563 states and 751 transitions. [2018-12-30 16:04:07,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 16:04:07,498 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 751 transitions. [2018-12-30 16:04:07,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-30 16:04:07,501 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:07,501 INFO L402 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] [2018-12-30 16:04:07,503 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:07,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:07,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1184010678, now seen corresponding path program 1 times [2018-12-30 16:04:07,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:07,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:07,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:07,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:07,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:07,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:07,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:07,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:07,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:04:07,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:04:07,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:04:07,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:07,570 INFO L87 Difference]: Start difference. First operand 563 states and 751 transitions. Second operand 3 states. [2018-12-30 16:04:08,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:08,370 INFO L93 Difference]: Finished difference Result 563 states and 751 transitions. [2018-12-30 16:04:08,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:04:08,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-30 16:04:08,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:08,376 INFO L225 Difference]: With dead ends: 563 [2018-12-30 16:04:08,376 INFO L226 Difference]: Without dead ends: 551 [2018-12-30 16:04:08,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:08,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2018-12-30 16:04:08,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2018-12-30 16:04:08,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2018-12-30 16:04:08,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 738 transitions. [2018-12-30 16:04:08,415 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 738 transitions. Word has length 25 [2018-12-30 16:04:08,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:08,416 INFO L480 AbstractCegarLoop]: Abstraction has 551 states and 738 transitions. [2018-12-30 16:04:08,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:04:08,416 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 738 transitions. [2018-12-30 16:04:08,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-30 16:04:08,419 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:08,419 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:04:08,421 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:08,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:08,421 INFO L82 PathProgramCache]: Analyzing trace with hash -944626100, now seen corresponding path program 1 times [2018-12-30 16:04:08,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:08,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:08,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:08,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:08,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:08,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:08,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:08,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:04:08,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:04:08,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:04:08,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:08,511 INFO L87 Difference]: Start difference. First operand 551 states and 738 transitions. Second operand 3 states. [2018-12-30 16:04:08,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:08,958 INFO L93 Difference]: Finished difference Result 759 states and 1016 transitions. [2018-12-30 16:04:08,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:04:08,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-30 16:04:08,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:08,963 INFO L225 Difference]: With dead ends: 759 [2018-12-30 16:04:08,964 INFO L226 Difference]: Without dead ends: 553 [2018-12-30 16:04:08,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:08,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2018-12-30 16:04:08,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2018-12-30 16:04:08,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2018-12-30 16:04:08,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 741 transitions. [2018-12-30 16:04:09,000 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 741 transitions. Word has length 28 [2018-12-30 16:04:09,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:09,000 INFO L480 AbstractCegarLoop]: Abstraction has 553 states and 741 transitions. [2018-12-30 16:04:09,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:04:09,000 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 741 transitions. [2018-12-30 16:04:09,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-30 16:04:09,001 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:09,001 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:04:09,002 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:09,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:09,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1312752221, now seen corresponding path program 1 times [2018-12-30 16:04:09,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:09,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:09,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:09,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:09,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:09,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:09,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:09,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:04:09,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:04:09,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:04:09,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:09,085 INFO L87 Difference]: Start difference. First operand 553 states and 741 transitions. Second operand 3 states. [2018-12-30 16:04:09,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:09,207 INFO L93 Difference]: Finished difference Result 733 states and 975 transitions. [2018-12-30 16:04:09,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:04:09,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-30 16:04:09,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:09,214 INFO L225 Difference]: With dead ends: 733 [2018-12-30 16:04:09,215 INFO L226 Difference]: Without dead ends: 529 [2018-12-30 16:04:09,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:09,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-12-30 16:04:09,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 513. [2018-12-30 16:04:09,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-12-30 16:04:09,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 683 transitions. [2018-12-30 16:04:09,254 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 683 transitions. Word has length 29 [2018-12-30 16:04:09,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:09,255 INFO L480 AbstractCegarLoop]: Abstraction has 513 states and 683 transitions. [2018-12-30 16:04:09,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:04:09,255 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 683 transitions. [2018-12-30 16:04:09,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-30 16:04:09,263 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:09,263 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:04:09,265 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:09,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:09,265 INFO L82 PathProgramCache]: Analyzing trace with hash 259846608, now seen corresponding path program 1 times [2018-12-30 16:04:09,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:09,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:09,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:09,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:09,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:09,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:09,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:09,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:09,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 16:04:09,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 16:04:09,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 16:04:09,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:04:09,466 INFO L87 Difference]: Start difference. First operand 513 states and 683 transitions. Second operand 5 states. [2018-12-30 16:04:10,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:10,100 INFO L93 Difference]: Finished difference Result 1324 states and 1762 transitions. [2018-12-30 16:04:10,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-30 16:04:10,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-12-30 16:04:10,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:10,106 INFO L225 Difference]: With dead ends: 1324 [2018-12-30 16:04:10,106 INFO L226 Difference]: Without dead ends: 1052 [2018-12-30 16:04:10,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-30 16:04:10,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2018-12-30 16:04:10,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 552. [2018-12-30 16:04:10,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-12-30 16:04:10,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 741 transitions. [2018-12-30 16:04:10,182 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 741 transitions. Word has length 32 [2018-12-30 16:04:10,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:10,184 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 741 transitions. [2018-12-30 16:04:10,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 16:04:10,184 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 741 transitions. [2018-12-30 16:04:10,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-30 16:04:10,185 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:10,185 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:04:10,188 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:10,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:10,190 INFO L82 PathProgramCache]: Analyzing trace with hash 255000751, now seen corresponding path program 1 times [2018-12-30 16:04:10,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:10,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:10,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:10,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:10,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:10,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:10,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:10,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 16:04:10,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 16:04:10,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 16:04:10,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:04:10,426 INFO L87 Difference]: Start difference. First operand 552 states and 741 transitions. Second operand 5 states. [2018-12-30 16:04:10,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:10,768 INFO L93 Difference]: Finished difference Result 572 states and 763 transitions. [2018-12-30 16:04:10,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 16:04:10,769 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-12-30 16:04:10,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:10,772 INFO L225 Difference]: With dead ends: 572 [2018-12-30 16:04:10,772 INFO L226 Difference]: Without dead ends: 555 [2018-12-30 16:04:10,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-30 16:04:10,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-12-30 16:04:10,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 552. [2018-12-30 16:04:10,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-12-30 16:04:10,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 740 transitions. [2018-12-30 16:04:10,816 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 740 transitions. Word has length 32 [2018-12-30 16:04:10,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:10,817 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 740 transitions. [2018-12-30 16:04:10,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 16:04:10,817 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 740 transitions. [2018-12-30 16:04:10,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-30 16:04:10,818 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:10,818 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:04:10,822 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:10,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:10,822 INFO L82 PathProgramCache]: Analyzing trace with hash 175699761, now seen corresponding path program 1 times [2018-12-30 16:04:10,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:10,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:10,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:10,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:10,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:10,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:10,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:10,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:10,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:04:10,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:04:10,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:04:10,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:10,906 INFO L87 Difference]: Start difference. First operand 552 states and 740 transitions. Second operand 3 states. [2018-12-30 16:04:11,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:11,153 INFO L93 Difference]: Finished difference Result 812 states and 1079 transitions. [2018-12-30 16:04:11,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:04:11,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-30 16:04:11,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:11,158 INFO L225 Difference]: With dead ends: 812 [2018-12-30 16:04:11,158 INFO L226 Difference]: Without dead ends: 613 [2018-12-30 16:04:11,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:11,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-12-30 16:04:11,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 540. [2018-12-30 16:04:11,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2018-12-30 16:04:11,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 722 transitions. [2018-12-30 16:04:11,205 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 722 transitions. Word has length 33 [2018-12-30 16:04:11,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:11,206 INFO L480 AbstractCegarLoop]: Abstraction has 540 states and 722 transitions. [2018-12-30 16:04:11,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:04:11,206 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 722 transitions. [2018-12-30 16:04:11,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-30 16:04:11,209 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:11,209 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:04:11,211 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:11,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:11,211 INFO L82 PathProgramCache]: Analyzing trace with hash -744399452, now seen corresponding path program 1 times [2018-12-30 16:04:11,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:11,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:11,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:11,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:11,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:11,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:11,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:11,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:04:11,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:04:11,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:04:11,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:11,287 INFO L87 Difference]: Start difference. First operand 540 states and 722 transitions. Second operand 3 states. [2018-12-30 16:04:11,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:11,663 INFO L93 Difference]: Finished difference Result 716 states and 944 transitions. [2018-12-30 16:04:11,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:04:11,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-30 16:04:11,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:11,667 INFO L225 Difference]: With dead ends: 716 [2018-12-30 16:04:11,667 INFO L226 Difference]: Without dead ends: 703 [2018-12-30 16:04:11,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:11,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2018-12-30 16:04:11,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 587. [2018-12-30 16:04:11,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-12-30 16:04:11,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 779 transitions. [2018-12-30 16:04:11,722 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 779 transitions. Word has length 33 [2018-12-30 16:04:11,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:11,723 INFO L480 AbstractCegarLoop]: Abstraction has 587 states and 779 transitions. [2018-12-30 16:04:11,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:04:11,723 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 779 transitions. [2018-12-30 16:04:11,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-30 16:04:11,724 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:11,724 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:04:11,727 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:11,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:11,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1784201236, now seen corresponding path program 1 times [2018-12-30 16:04:11,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:11,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:11,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:11,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:11,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:11,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:11,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:11,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:04:11,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:04:11,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:04:11,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:11,805 INFO L87 Difference]: Start difference. First operand 587 states and 779 transitions. Second operand 3 states. [2018-12-30 16:04:11,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:11,948 INFO L93 Difference]: Finished difference Result 625 states and 824 transitions. [2018-12-30 16:04:11,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:04:11,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-30 16:04:11,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:11,951 INFO L225 Difference]: With dead ends: 625 [2018-12-30 16:04:11,951 INFO L226 Difference]: Without dead ends: 581 [2018-12-30 16:04:11,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:11,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2018-12-30 16:04:11,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 577. [2018-12-30 16:04:11,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2018-12-30 16:04:12,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 758 transitions. [2018-12-30 16:04:12,000 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 758 transitions. Word has length 34 [2018-12-30 16:04:12,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:12,000 INFO L480 AbstractCegarLoop]: Abstraction has 577 states and 758 transitions. [2018-12-30 16:04:12,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:04:12,001 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 758 transitions. [2018-12-30 16:04:12,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-30 16:04:12,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:12,002 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:04:12,002 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:12,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:12,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1583955411, now seen corresponding path program 1 times [2018-12-30 16:04:12,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:12,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:12,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:12,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:12,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:12,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:12,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:12,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:04:12,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 16:04:12,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 16:04:12,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:04:12,173 INFO L87 Difference]: Start difference. First operand 577 states and 758 transitions. Second operand 4 states. [2018-12-30 16:04:12,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:12,341 INFO L93 Difference]: Finished difference Result 1364 states and 1773 transitions. [2018-12-30 16:04:12,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 16:04:12,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-12-30 16:04:12,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:12,346 INFO L225 Difference]: With dead ends: 1364 [2018-12-30 16:04:12,347 INFO L226 Difference]: Without dead ends: 796 [2018-12-30 16:04:12,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:04:12,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2018-12-30 16:04:12,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 669. [2018-12-30 16:04:12,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2018-12-30 16:04:12,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 872 transitions. [2018-12-30 16:04:12,413 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 872 transitions. Word has length 34 [2018-12-30 16:04:12,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:12,413 INFO L480 AbstractCegarLoop]: Abstraction has 669 states and 872 transitions. [2018-12-30 16:04:12,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 16:04:12,413 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 872 transitions. [2018-12-30 16:04:12,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-30 16:04:12,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:12,414 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:04:12,415 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:12,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:12,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1645995025, now seen corresponding path program 1 times [2018-12-30 16:04:12,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:12,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:12,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:12,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:12,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:12,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:12,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:12,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 16:04:12,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 16:04:12,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 16:04:12,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:04:12,573 INFO L87 Difference]: Start difference. First operand 669 states and 872 transitions. Second operand 4 states. [2018-12-30 16:04:13,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:13,405 INFO L93 Difference]: Finished difference Result 681 states and 882 transitions. [2018-12-30 16:04:13,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 16:04:13,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-12-30 16:04:13,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:13,409 INFO L225 Difference]: With dead ends: 681 [2018-12-30 16:04:13,409 INFO L226 Difference]: Without dead ends: 614 [2018-12-30 16:04:13,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:04:13,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2018-12-30 16:04:13,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2018-12-30 16:04:13,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2018-12-30 16:04:13,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 791 transitions. [2018-12-30 16:04:13,464 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 791 transitions. Word has length 34 [2018-12-30 16:04:13,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:13,465 INFO L480 AbstractCegarLoop]: Abstraction has 614 states and 791 transitions. [2018-12-30 16:04:13,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 16:04:13,465 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 791 transitions. [2018-12-30 16:04:13,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-30 16:04:13,466 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:13,466 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:04:13,467 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:13,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:13,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1613450795, now seen corresponding path program 1 times [2018-12-30 16:04:13,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:13,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:13,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:13,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:13,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:13,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:13,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:13,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:04:13,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:04:13,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:04:13,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:13,554 INFO L87 Difference]: Start difference. First operand 614 states and 791 transitions. Second operand 3 states. [2018-12-30 16:04:13,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:13,765 INFO L93 Difference]: Finished difference Result 833 states and 1059 transitions. [2018-12-30 16:04:13,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:04:13,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-30 16:04:13,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:13,769 INFO L225 Difference]: With dead ends: 833 [2018-12-30 16:04:13,769 INFO L226 Difference]: Without dead ends: 724 [2018-12-30 16:04:13,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:13,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2018-12-30 16:04:13,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 615. [2018-12-30 16:04:13,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2018-12-30 16:04:13,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 792 transitions. [2018-12-30 16:04:13,839 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 792 transitions. Word has length 34 [2018-12-30 16:04:13,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:13,839 INFO L480 AbstractCegarLoop]: Abstraction has 615 states and 792 transitions. [2018-12-30 16:04:13,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:04:13,840 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 792 transitions. [2018-12-30 16:04:13,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-30 16:04:13,841 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:13,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:04:13,842 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:13,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:13,842 INFO L82 PathProgramCache]: Analyzing trace with hash -992572759, now seen corresponding path program 1 times [2018-12-30 16:04:13,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:13,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:13,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:13,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:13,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:14,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:14,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:14,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 16:04:14,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 16:04:14,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 16:04:14,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:04:14,090 INFO L87 Difference]: Start difference. First operand 615 states and 792 transitions. Second operand 4 states. [2018-12-30 16:04:14,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:14,466 INFO L93 Difference]: Finished difference Result 804 states and 1035 transitions. [2018-12-30 16:04:14,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 16:04:14,468 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-12-30 16:04:14,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:14,471 INFO L225 Difference]: With dead ends: 804 [2018-12-30 16:04:14,472 INFO L226 Difference]: Without dead ends: 585 [2018-12-30 16:04:14,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:04:14,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2018-12-30 16:04:14,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 580. [2018-12-30 16:04:14,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2018-12-30 16:04:14,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 741 transitions. [2018-12-30 16:04:14,574 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 741 transitions. Word has length 34 [2018-12-30 16:04:14,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:14,574 INFO L480 AbstractCegarLoop]: Abstraction has 580 states and 741 transitions. [2018-12-30 16:04:14,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 16:04:14,575 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 741 transitions. [2018-12-30 16:04:14,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-30 16:04:14,576 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:14,576 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:04:14,576 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:14,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:14,577 INFO L82 PathProgramCache]: Analyzing trace with hash 813687739, now seen corresponding path program 1 times [2018-12-30 16:04:14,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:14,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:14,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:14,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:14,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:14,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:14,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:14,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:14,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 16:04:14,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 16:04:14,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 16:04:14,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:04:14,738 INFO L87 Difference]: Start difference. First operand 580 states and 741 transitions. Second operand 4 states. [2018-12-30 16:04:15,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:15,512 INFO L93 Difference]: Finished difference Result 653 states and 823 transitions. [2018-12-30 16:04:15,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 16:04:15,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-12-30 16:04:15,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:15,517 INFO L225 Difference]: With dead ends: 653 [2018-12-30 16:04:15,518 INFO L226 Difference]: Without dead ends: 564 [2018-12-30 16:04:15,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:04:15,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2018-12-30 16:04:15,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 546. [2018-12-30 16:04:15,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2018-12-30 16:04:15,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 684 transitions. [2018-12-30 16:04:15,584 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 684 transitions. Word has length 35 [2018-12-30 16:04:15,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:15,586 INFO L480 AbstractCegarLoop]: Abstraction has 546 states and 684 transitions. [2018-12-30 16:04:15,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 16:04:15,587 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 684 transitions. [2018-12-30 16:04:15,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-30 16:04:15,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:15,589 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:04:15,589 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:15,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:15,593 INFO L82 PathProgramCache]: Analyzing trace with hash -759040003, now seen corresponding path program 1 times [2018-12-30 16:04:15,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:15,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:15,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:15,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:15,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:15,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:15,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:15,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:04:15,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:04:15,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:04:15,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:15,685 INFO L87 Difference]: Start difference. First operand 546 states and 684 transitions. Second operand 3 states. [2018-12-30 16:04:15,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:15,993 INFO L93 Difference]: Finished difference Result 569 states and 703 transitions. [2018-12-30 16:04:15,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:04:15,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-30 16:04:15,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:15,996 INFO L225 Difference]: With dead ends: 569 [2018-12-30 16:04:15,996 INFO L226 Difference]: Without dead ends: 549 [2018-12-30 16:04:15,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:15,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2018-12-30 16:04:16,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 540. [2018-12-30 16:04:16,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2018-12-30 16:04:16,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 673 transitions. [2018-12-30 16:04:16,040 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 673 transitions. Word has length 35 [2018-12-30 16:04:16,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:16,040 INFO L480 AbstractCegarLoop]: Abstraction has 540 states and 673 transitions. [2018-12-30 16:04:16,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:04:16,040 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 673 transitions. [2018-12-30 16:04:16,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-30 16:04:16,041 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:16,042 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:04:16,042 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:16,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:16,042 INFO L82 PathProgramCache]: Analyzing trace with hash 111409610, now seen corresponding path program 1 times [2018-12-30 16:04:16,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:16,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:16,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:16,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:16,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:16,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:16,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:16,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 16:04:16,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 16:04:16,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 16:04:16,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:04:16,178 INFO L87 Difference]: Start difference. First operand 540 states and 673 transitions. Second operand 4 states. [2018-12-30 16:04:16,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:16,421 INFO L93 Difference]: Finished difference Result 721 states and 907 transitions. [2018-12-30 16:04:16,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 16:04:16,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-12-30 16:04:16,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:16,424 INFO L225 Difference]: With dead ends: 721 [2018-12-30 16:04:16,424 INFO L226 Difference]: Without dead ends: 537 [2018-12-30 16:04:16,425 INFO L631 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 [2018-12-30 16:04:16,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-12-30 16:04:16,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2018-12-30 16:04:16,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-12-30 16:04:16,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 664 transitions. [2018-12-30 16:04:16,487 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 664 transitions. Word has length 35 [2018-12-30 16:04:16,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:16,487 INFO L480 AbstractCegarLoop]: Abstraction has 537 states and 664 transitions. [2018-12-30 16:04:16,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 16:04:16,487 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 664 transitions. [2018-12-30 16:04:16,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-30 16:04:16,488 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:16,488 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:04:16,489 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:16,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:16,489 INFO L82 PathProgramCache]: Analyzing trace with hash 2063815052, now seen corresponding path program 1 times [2018-12-30 16:04:16,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:16,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:16,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:16,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:16,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:16,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:16,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:16,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 16:04:16,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 16:04:16,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 16:04:16,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:04:16,576 INFO L87 Difference]: Start difference. First operand 537 states and 664 transitions. Second operand 4 states. [2018-12-30 16:04:16,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:16,755 INFO L93 Difference]: Finished difference Result 550 states and 674 transitions. [2018-12-30 16:04:16,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 16:04:16,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-12-30 16:04:16,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:16,758 INFO L225 Difference]: With dead ends: 550 [2018-12-30 16:04:16,759 INFO L226 Difference]: Without dead ends: 541 [2018-12-30 16:04:16,759 INFO L631 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 [2018-12-30 16:04:16,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2018-12-30 16:04:16,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 537. [2018-12-30 16:04:16,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-12-30 16:04:16,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 662 transitions. [2018-12-30 16:04:16,816 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 662 transitions. Word has length 36 [2018-12-30 16:04:16,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:16,817 INFO L480 AbstractCegarLoop]: Abstraction has 537 states and 662 transitions. [2018-12-30 16:04:16,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 16:04:16,817 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 662 transitions. [2018-12-30 16:04:16,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-30 16:04:16,818 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:16,818 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:04:16,818 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:16,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:16,819 INFO L82 PathProgramCache]: Analyzing trace with hash -2037812492, now seen corresponding path program 1 times [2018-12-30 16:04:16,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:16,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:16,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:16,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:16,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:16,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:16,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:16,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-30 16:04:16,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 16:04:16,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 16:04:16,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-30 16:04:16,965 INFO L87 Difference]: Start difference. First operand 537 states and 662 transitions. Second operand 7 states. [2018-12-30 16:04:17,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:17,348 INFO L93 Difference]: Finished difference Result 784 states and 953 transitions. [2018-12-30 16:04:17,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-30 16:04:17,348 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-12-30 16:04:17,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:17,351 INFO L225 Difference]: With dead ends: 784 [2018-12-30 16:04:17,351 INFO L226 Difference]: Without dead ends: 764 [2018-12-30 16:04:17,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-12-30 16:04:17,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2018-12-30 16:04:17,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 536. [2018-12-30 16:04:17,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-12-30 16:04:17,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 660 transitions. [2018-12-30 16:04:17,403 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 660 transitions. Word has length 36 [2018-12-30 16:04:17,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:17,404 INFO L480 AbstractCegarLoop]: Abstraction has 536 states and 660 transitions. [2018-12-30 16:04:17,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 16:04:17,404 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 660 transitions. [2018-12-30 16:04:17,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-30 16:04:17,405 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:17,405 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:04:17,406 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:17,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:17,406 INFO L82 PathProgramCache]: Analyzing trace with hash -463076180, now seen corresponding path program 1 times [2018-12-30 16:04:17,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:17,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:17,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:17,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:17,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:17,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:17,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:17,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:17,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 16:04:17,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 16:04:17,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 16:04:17,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:04:17,490 INFO L87 Difference]: Start difference. First operand 536 states and 660 transitions. Second operand 4 states. [2018-12-30 16:04:17,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:17,752 INFO L93 Difference]: Finished difference Result 549 states and 670 transitions. [2018-12-30 16:04:17,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 16:04:17,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-12-30 16:04:17,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:17,756 INFO L225 Difference]: With dead ends: 549 [2018-12-30 16:04:17,756 INFO L226 Difference]: Without dead ends: 540 [2018-12-30 16:04:17,757 INFO L631 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 [2018-12-30 16:04:17,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2018-12-30 16:04:17,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 536. [2018-12-30 16:04:17,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-12-30 16:04:17,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 658 transitions. [2018-12-30 16:04:17,804 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 658 transitions. Word has length 37 [2018-12-30 16:04:17,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:17,804 INFO L480 AbstractCegarLoop]: Abstraction has 536 states and 658 transitions. [2018-12-30 16:04:17,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 16:04:17,805 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 658 transitions. [2018-12-30 16:04:17,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-30 16:04:17,806 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:17,806 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:04:17,806 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:17,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:17,807 INFO L82 PathProgramCache]: Analyzing trace with hash -187254176, now seen corresponding path program 1 times [2018-12-30 16:04:17,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:17,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:17,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:17,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:17,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:18,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:18,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:18,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-30 16:04:18,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 16:04:18,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 16:04:18,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-30 16:04:18,102 INFO L87 Difference]: Start difference. First operand 536 states and 658 transitions. Second operand 6 states. [2018-12-30 16:04:18,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:18,410 INFO L93 Difference]: Finished difference Result 554 states and 674 transitions. [2018-12-30 16:04:18,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-30 16:04:18,411 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-12-30 16:04:18,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:18,413 INFO L225 Difference]: With dead ends: 554 [2018-12-30 16:04:18,413 INFO L226 Difference]: Without dead ends: 551 [2018-12-30 16:04:18,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-30 16:04:18,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2018-12-30 16:04:18,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 542. [2018-12-30 16:04:18,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2018-12-30 16:04:18,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 664 transitions. [2018-12-30 16:04:18,468 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 664 transitions. Word has length 37 [2018-12-30 16:04:18,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:18,468 INFO L480 AbstractCegarLoop]: Abstraction has 542 states and 664 transitions. [2018-12-30 16:04:18,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 16:04:18,468 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 664 transitions. [2018-12-30 16:04:18,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-30 16:04:18,469 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:18,469 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:04:18,470 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:18,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:18,470 INFO L82 PathProgramCache]: Analyzing trace with hash -187266092, now seen corresponding path program 1 times [2018-12-30 16:04:18,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:18,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:18,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:18,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:18,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:18,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:18,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:18,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 16:04:18,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 16:04:18,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 16:04:18,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:04:18,726 INFO L87 Difference]: Start difference. First operand 542 states and 664 transitions. Second operand 5 states. [2018-12-30 16:04:19,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:19,210 INFO L93 Difference]: Finished difference Result 551 states and 671 transitions. [2018-12-30 16:04:19,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 16:04:19,212 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-12-30 16:04:19,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:19,215 INFO L225 Difference]: With dead ends: 551 [2018-12-30 16:04:19,215 INFO L226 Difference]: Without dead ends: 527 [2018-12-30 16:04:19,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:04:19,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-12-30 16:04:19,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 523. [2018-12-30 16:04:19,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2018-12-30 16:04:19,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 642 transitions. [2018-12-30 16:04:19,268 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 642 transitions. Word has length 37 [2018-12-30 16:04:19,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:19,268 INFO L480 AbstractCegarLoop]: Abstraction has 523 states and 642 transitions. [2018-12-30 16:04:19,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 16:04:19,268 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 642 transitions. [2018-12-30 16:04:19,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-30 16:04:19,273 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:19,273 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:04:19,273 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:19,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:19,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1481841291, now seen corresponding path program 1 times [2018-12-30 16:04:19,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:19,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:19,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:19,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:19,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:19,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:19,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:19,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 16:04:19,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 16:04:19,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 16:04:19,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-30 16:04:19,462 INFO L87 Difference]: Start difference. First operand 523 states and 642 transitions. Second operand 4 states. [2018-12-30 16:04:19,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:19,538 INFO L93 Difference]: Finished difference Result 541 states and 658 transitions. [2018-12-30 16:04:19,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 16:04:19,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-30 16:04:19,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:19,541 INFO L225 Difference]: With dead ends: 541 [2018-12-30 16:04:19,541 INFO L226 Difference]: Without dead ends: 520 [2018-12-30 16:04:19,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:04:19,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2018-12-30 16:04:19,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 506. [2018-12-30 16:04:19,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-12-30 16:04:19,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 622 transitions. [2018-12-30 16:04:19,590 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 622 transitions. Word has length 38 [2018-12-30 16:04:19,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:19,591 INFO L480 AbstractCegarLoop]: Abstraction has 506 states and 622 transitions. [2018-12-30 16:04:19,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 16:04:19,591 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 622 transitions. [2018-12-30 16:04:19,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-30 16:04:19,592 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:19,592 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:04:19,592 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:19,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:19,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1021756590, now seen corresponding path program 1 times [2018-12-30 16:04:19,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:19,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:19,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:19,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:19,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:19,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:19,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:19,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:04:19,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:04:19,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:04:19,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:19,667 INFO L87 Difference]: Start difference. First operand 506 states and 622 transitions. Second operand 3 states. [2018-12-30 16:04:19,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:19,963 INFO L93 Difference]: Finished difference Result 870 states and 1065 transitions. [2018-12-30 16:04:19,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:04:19,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-12-30 16:04:19,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:19,968 INFO L225 Difference]: With dead ends: 870 [2018-12-30 16:04:19,968 INFO L226 Difference]: Without dead ends: 689 [2018-12-30 16:04:19,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:19,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2018-12-30 16:04:20,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 509. [2018-12-30 16:04:20,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2018-12-30 16:04:20,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 625 transitions. [2018-12-30 16:04:20,034 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 625 transitions. Word has length 38 [2018-12-30 16:04:20,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:20,035 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 625 transitions. [2018-12-30 16:04:20,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:04:20,035 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 625 transitions. [2018-12-30 16:04:20,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-30 16:04:20,036 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:20,036 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:04:20,036 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:20,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:20,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1329794158, now seen corresponding path program 1 times [2018-12-30 16:04:20,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:20,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:20,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:20,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:20,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:20,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:20,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:20,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 16:04:20,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 16:04:20,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 16:04:20,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:04:20,236 INFO L87 Difference]: Start difference. First operand 509 states and 625 transitions. Second operand 5 states. [2018-12-30 16:04:20,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:20,545 INFO L93 Difference]: Finished difference Result 855 states and 1033 transitions. [2018-12-30 16:04:20,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 16:04:20,546 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-12-30 16:04:20,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:20,551 INFO L225 Difference]: With dead ends: 855 [2018-12-30 16:04:20,552 INFO L226 Difference]: Without dead ends: 699 [2018-12-30 16:04:20,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-30 16:04:20,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2018-12-30 16:04:20,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 509. [2018-12-30 16:04:20,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2018-12-30 16:04:20,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 621 transitions. [2018-12-30 16:04:20,647 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 621 transitions. Word has length 38 [2018-12-30 16:04:20,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:20,647 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 621 transitions. [2018-12-30 16:04:20,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 16:04:20,648 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 621 transitions. [2018-12-30 16:04:20,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-30 16:04:20,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:20,653 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:04:20,653 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:20,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:20,654 INFO L82 PathProgramCache]: Analyzing trace with hash 595887759, now seen corresponding path program 1 times [2018-12-30 16:04:20,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:20,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:20,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:20,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:20,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:20,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:20,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:20,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 16:04:20,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 16:04:21,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 16:04:21,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-30 16:04:21,000 INFO L87 Difference]: Start difference. First operand 509 states and 621 transitions. Second operand 5 states. [2018-12-30 16:04:21,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:21,360 INFO L93 Difference]: Finished difference Result 977 states and 1195 transitions. [2018-12-30 16:04:21,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-30 16:04:21,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-12-30 16:04:21,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:21,365 INFO L225 Difference]: With dead ends: 977 [2018-12-30 16:04:21,365 INFO L226 Difference]: Without dead ends: 847 [2018-12-30 16:04:21,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-30 16:04:21,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2018-12-30 16:04:21,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 509. [2018-12-30 16:04:21,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2018-12-30 16:04:21,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 620 transitions. [2018-12-30 16:04:21,432 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 620 transitions. Word has length 41 [2018-12-30 16:04:21,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:21,432 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 620 transitions. [2018-12-30 16:04:21,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 16:04:21,433 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 620 transitions. [2018-12-30 16:04:21,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-30 16:04:21,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:21,434 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:04:21,434 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:21,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:21,434 INFO L82 PathProgramCache]: Analyzing trace with hash 768333102, now seen corresponding path program 1 times [2018-12-30 16:04:21,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:21,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:21,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:21,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:21,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:21,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:21,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:21,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:21,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-30 16:04:21,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 16:04:21,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 16:04:21,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-30 16:04:21,547 INFO L87 Difference]: Start difference. First operand 509 states and 620 transitions. Second operand 7 states. [2018-12-30 16:04:21,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:21,860 INFO L93 Difference]: Finished difference Result 527 states and 637 transitions. [2018-12-30 16:04:21,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-30 16:04:21,862 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-12-30 16:04:21,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:21,863 INFO L225 Difference]: With dead ends: 527 [2018-12-30 16:04:21,864 INFO L226 Difference]: Without dead ends: 385 [2018-12-30 16:04:21,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-12-30 16:04:21,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-12-30 16:04:21,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 367. [2018-12-30 16:04:21,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-12-30 16:04:21,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 446 transitions. [2018-12-30 16:04:21,913 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 446 transitions. Word has length 41 [2018-12-30 16:04:21,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:21,914 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 446 transitions. [2018-12-30 16:04:21,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 16:04:21,914 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 446 transitions. [2018-12-30 16:04:21,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-30 16:04:21,920 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:21,920 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:04:21,920 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:21,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:21,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1022149612, now seen corresponding path program 1 times [2018-12-30 16:04:21,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:21,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:21,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:21,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:21,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:21,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:21,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:21,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:04:21,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:04:21,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:04:21,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:21,998 INFO L87 Difference]: Start difference. First operand 367 states and 446 transitions. Second operand 3 states. [2018-12-30 16:04:22,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:22,197 INFO L93 Difference]: Finished difference Result 500 states and 615 transitions. [2018-12-30 16:04:22,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:04:22,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-12-30 16:04:22,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:22,200 INFO L225 Difference]: With dead ends: 500 [2018-12-30 16:04:22,200 INFO L226 Difference]: Without dead ends: 329 [2018-12-30 16:04:22,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:22,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-12-30 16:04:22,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2018-12-30 16:04:22,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-12-30 16:04:22,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 397 transitions. [2018-12-30 16:04:22,244 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 397 transitions. Word has length 45 [2018-12-30 16:04:22,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:22,244 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 397 transitions. [2018-12-30 16:04:22,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:04:22,244 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 397 transitions. [2018-12-30 16:04:22,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-30 16:04:22,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:22,245 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:04:22,246 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:22,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:22,246 INFO L82 PathProgramCache]: Analyzing trace with hash 632304062, now seen corresponding path program 1 times [2018-12-30 16:04:22,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:22,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:22,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:22,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:22,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:22,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:22,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:22,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-30 16:04:22,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 16:04:22,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 16:04:22,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-30 16:04:22,504 INFO L87 Difference]: Start difference. First operand 329 states and 397 transitions. Second operand 7 states. [2018-12-30 16:04:22,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:22,757 INFO L93 Difference]: Finished difference Result 459 states and 546 transitions. [2018-12-30 16:04:22,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-30 16:04:22,758 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-12-30 16:04:22,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:22,760 INFO L225 Difference]: With dead ends: 459 [2018-12-30 16:04:22,760 INFO L226 Difference]: Without dead ends: 441 [2018-12-30 16:04:22,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-12-30 16:04:22,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-12-30 16:04:22,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 335. [2018-12-30 16:04:22,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-12-30 16:04:22,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 403 transitions. [2018-12-30 16:04:22,806 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 403 transitions. Word has length 51 [2018-12-30 16:04:22,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:22,807 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 403 transitions. [2018-12-30 16:04:22,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 16:04:22,807 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 403 transitions. [2018-12-30 16:04:22,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-30 16:04:22,808 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:22,808 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:04:22,808 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:22,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:22,809 INFO L82 PathProgramCache]: Analyzing trace with hash -605199811, now seen corresponding path program 1 times [2018-12-30 16:04:22,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:22,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:22,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:22,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:22,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:22,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:23,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:23,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:23,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-30 16:04:23,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 16:04:23,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 16:04:23,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-30 16:04:23,327 INFO L87 Difference]: Start difference. First operand 335 states and 403 transitions. Second operand 7 states. [2018-12-30 16:04:24,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:24,011 INFO L93 Difference]: Finished difference Result 464 states and 551 transitions. [2018-12-30 16:04:24,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-30 16:04:24,012 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-12-30 16:04:24,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:24,014 INFO L225 Difference]: With dead ends: 464 [2018-12-30 16:04:24,014 INFO L226 Difference]: Without dead ends: 446 [2018-12-30 16:04:24,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-12-30 16:04:24,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-12-30 16:04:24,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 329. [2018-12-30 16:04:24,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-12-30 16:04:24,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 396 transitions. [2018-12-30 16:04:24,087 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 396 transitions. Word has length 52 [2018-12-30 16:04:24,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:24,087 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 396 transitions. [2018-12-30 16:04:24,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 16:04:24,088 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 396 transitions. [2018-12-30 16:04:24,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-30 16:04:24,088 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:24,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:04:24,089 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:24,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:24,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1054423066, now seen corresponding path program 1 times [2018-12-30 16:04:24,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:24,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:24,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:24,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:24,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:24,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:04:24,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:04:24,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:04:24,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:04:24,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:04:24,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:04:24,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:24,180 INFO L87 Difference]: Start difference. First operand 329 states and 396 transitions. Second operand 3 states. [2018-12-30 16:04:24,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:04:24,397 INFO L93 Difference]: Finished difference Result 575 states and 698 transitions. [2018-12-30 16:04:24,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:04:24,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-12-30 16:04:24,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:04:24,399 INFO L225 Difference]: With dead ends: 575 [2018-12-30 16:04:24,399 INFO L226 Difference]: Without dead ends: 383 [2018-12-30 16:04:24,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:04:24,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-12-30 16:04:24,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 329. [2018-12-30 16:04:24,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-12-30 16:04:24,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 392 transitions. [2018-12-30 16:04:24,448 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 392 transitions. Word has length 54 [2018-12-30 16:04:24,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:04:24,449 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 392 transitions. [2018-12-30 16:04:24,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:04:24,449 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 392 transitions. [2018-12-30 16:04:24,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-30 16:04:24,450 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:04:24,450 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:04:24,450 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:04:24,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:04:24,450 INFO L82 PathProgramCache]: Analyzing trace with hash 273758220, now seen corresponding path program 1 times [2018-12-30 16:04:24,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:04:24,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:04:24,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:24,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:04:24,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:04:24,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-30 16:04:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-30 16:04:24,528 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-30 16:04:24,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 04:04:24 BoogieIcfgContainer [2018-12-30 16:04:24,647 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 16:04:24,648 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 16:04:24,648 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 16:04:24,648 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 16:04:24,649 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:03:59" (3/4) ... [2018-12-30 16:04:24,656 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-30 16:04:24,852 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 16:04:24,852 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 16:04:24,853 INFO L168 Benchmark]: Toolchain (without parser) took 29880.09 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 492.8 MB). Free memory was 952.7 MB in the beginning and 1.4 GB in the end (delta: -411.2 MB). Peak memory consumption was 81.6 MB. Max. memory is 11.5 GB. [2018-12-30 16:04:24,856 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 16:04:24,856 INFO L168 Benchmark]: CACSL2BoogieTranslator took 632.72 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 925.9 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-12-30 16:04:24,857 INFO L168 Benchmark]: Boogie Procedure Inliner took 224.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -181.8 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2018-12-30 16:04:24,859 INFO L168 Benchmark]: Boogie Preprocessor took 117.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 16:04:24,859 INFO L168 Benchmark]: RCFGBuilder took 3363.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 965.7 MB in the end (delta: 142.0 MB). Peak memory consumption was 142.0 MB. Max. memory is 11.5 GB. [2018-12-30 16:04:24,860 INFO L168 Benchmark]: TraceAbstraction took 25331.50 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 366.0 MB). Free memory was 965.7 MB in the beginning and 1.4 GB in the end (delta: -412.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 16:04:24,860 INFO L168 Benchmark]: Witness Printer took 204.36 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2018-12-30 16:04:24,862 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 632.72 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 925.9 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 224.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -181.8 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 117.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 3363.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 965.7 MB in the end (delta: 142.0 MB). Peak memory consumption was 142.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25331.50 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 366.0 MB). Free memory was 965.7 MB in the beginning and 1.4 GB in the end (delta: -412.1 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 204.36 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 64]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L35] int FloppyThread ; [L36] int KernelMode ; [L37] int Suspended ; [L38] int Executive ; [L39] int DiskController ; [L40] int FloppyDiskPeripheral ; [L41] int FlConfigCallBack ; [L42] int MaximumInterfaceType ; [L43] int MOUNTDEV_MOUNTED_DEVICE_GUID ; [L44] int myStatus ; [L45] int s ; [L46] int UNLOADED ; [L47] int NP ; [L48] int DC ; [L49] int SKIP1 ; [L50] int SKIP2 ; [L51] int MPR1 ; [L52] int MPR3 ; [L53] int IPC ; [L54] int pended ; [L55] int compRegistered ; [L56] int lowerDriverReturn ; [L57] int setEventCalled ; [L58] int customIrp ; [L90] int PagingReferenceCount = 0; [L91] int PagingMutex = 0; VAL [compRegistered=0, customIrp=0, DC=0, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=0, MPR3=0, myStatus=0, NP=0, PagingMutex=0, PagingReferenceCount=0, pended=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, Suspended=0, UNLOADED=0] [L670] int status ; [L671] int irp = __VERIFIER_nondet_int() ; [L672] int pirp ; [L673] int pirp__IoStatus__Status ; [L674] int irp_choice = __VERIFIER_nondet_int() ; [L675] int devobj = __VERIFIER_nondet_int() ; [L676] int __cil_tmp8 ; [L678] FloppyThread = 0 [L679] KernelMode = 0 [L680] Suspended = 0 [L681] Executive = 0 [L682] DiskController = 0 [L683] FloppyDiskPeripheral = 0 [L684] FlConfigCallBack = 0 [L685] MaximumInterfaceType = 0 [L686] MOUNTDEV_MOUNTED_DEVICE_GUID = 0 [L687] myStatus = 0 [L688] s = 0 [L689] UNLOADED = 0 [L690] NP = 0 [L691] DC = 0 [L692] SKIP1 = 0 [L693] SKIP2 = 0 [L694] MPR1 = 0 [L695] MPR3 = 0 [L696] IPC = 0 [L697] pended = 0 [L698] compRegistered = 0 [L699] lowerDriverReturn = 0 [L700] setEventCalled = 0 [L701] customIrp = 0 [L705] status = 0 [L706] pirp = irp [L73] UNLOADED = 0 [L74] NP = 1 [L75] DC = 2 [L76] SKIP1 = 3 [L77] SKIP2 = 4 [L78] MPR1 = 5 [L79] MPR3 = 6 [L80] IPC = 7 [L81] s = UNLOADED [L82] pended = 0 [L83] compRegistered = 0 [L84] lowerDriverReturn = 0 [L85] setEventCalled = 0 [L86] customIrp = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L709] COND TRUE status >= 0 [L710] s = NP [L711] customIrp = 0 [L712] setEventCalled = customIrp [L713] lowerDriverReturn = setEventCalled [L714] compRegistered = lowerDriverReturn [L715] pended = compRegistered [L716] pirp__IoStatus__Status = 0 [L717] myStatus = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L718] COND TRUE irp_choice == 0 [L719] pirp__IoStatus__Status = -1073741637 [L720] myStatus = -1073741637 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L660] s = NP [L661] pended = 0 [L662] compRegistered = 0 [L663] lowerDriverReturn = 0 [L664] setEventCalled = 0 [L665] customIrp = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L726] COND FALSE !(status < 0) [L730] int tmp_ndt_1; [L731] tmp_ndt_1 = __VERIFIER_nondet_int() [L732] COND TRUE tmp_ndt_1 == 3 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L163] int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ; [L164] int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ; [L165] int Irp__IoStatus__Information ; [L166] int Irp__IoStatus__Status ; [L167] int Irp__CurrentLocation = __VERIFIER_nondet_int() ; [L168] int disketteExtension__IsRemoved = __VERIFIER_nondet_int() ; [L169] int disketteExtension__IsStarted = __VERIFIER_nondet_int() ; [L170] int disketteExtension__TargetObject = __VERIFIER_nondet_int() ; [L171] int disketteExtension__HoldNewRequests ; [L172] int disketteExtension__FloppyThread = __VERIFIER_nondet_int() ; [L173] int disketteExtension__InterfaceString__Buffer = __VERIFIER_nondet_int() ; [L174] int disketteExtension__InterfaceString = __VERIFIER_nondet_int() ; [L175] int disketteExtension__ArcName__Length = __VERIFIER_nondet_int() ; [L176] int disketteExtension__ArcName = __VERIFIER_nondet_int() ; [L177] int irpSp__MinorFunction = __VERIFIER_nondet_int() ; [L178] int IoGetConfigurationInformation__FloppyCount = __VERIFIER_nondet_int() ; [L179] int irpSp ; [L180] int disketteExtension ; [L181] int ntStatus ; [L182] int doneEvent = __VERIFIER_nondet_int() ; [L183] int irpSp___0 ; [L184] int nextIrpSp ; [L185] int nextIrpSp__Control ; [L186] int irpSp___1 ; [L187] int irpSp__Context ; [L188] int irpSp__Control ; [L189] long __cil_tmp29 ; [L190] long __cil_tmp30 ; [L193] ntStatus = 0 [L194] PagingReferenceCount ++ VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L195] COND TRUE PagingReferenceCount == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L198] disketteExtension = DeviceObject__DeviceExtension [L199] irpSp = Irp__Tail__Overlay__CurrentStackLocation VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L200] COND FALSE !(\read(disketteExtension__IsRemoved)) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L209] COND FALSE !(irpSp__MinorFunction == 0) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L212] COND TRUE irpSp__MinorFunction == 5 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L238] COND TRUE irpSp__MinorFunction == 5 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L241] COND FALSE !(! disketteExtension__IsStarted) [L257] disketteExtension__HoldNewRequests = 1 [L100] int status ; [L101] int threadHandle = __VERIFIER_nondet_int() ; [L102] int DisketteExtension__PoweringDown = __VERIFIER_nondet_int() ; [L103] int DisketteExtension__ThreadReferenceCount = __VERIFIER_nondet_int() ; [L104] int DisketteExtension__FloppyThread = __VERIFIER_nondet_int() ; [L105] int Irp__IoStatus__Status ; [L106] int Irp__IoStatus__Information ; [L107] int Irp__Tail__Overlay__CurrentStackLocation__Control ; [L108] int ObjAttributes = __VERIFIER_nondet_int() ; [L109] int __cil_tmp12 ; [L110] int __cil_tmp13 ; VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L113] COND FALSE !(DisketteExtension__PoweringDown == 1) [L119] DisketteExtension__ThreadReferenceCount ++ VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L120] COND FALSE !(DisketteExtension__ThreadReferenceCount == 0) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L152] COND TRUE pended == 0 [L153] pended = 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L159] return (259); VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L258] ntStatus = FlQueueIrpToThread(Irp, disketteExtension) [L261] __cil_tmp29 = (long )ntStatus VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L262] COND TRUE __cil_tmp29 == 259L [L1035] COND FALSE !(s == MPR3) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1044] COND FALSE !(customIrp == 1) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1048] COND FALSE !(s == MPR3) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1055] int tmp_ndt_8; [L1056] tmp_ndt_8 = __VERIFIER_nondet_int() [L1057] COND TRUE tmp_ndt_8 == 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1063] return (0); VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L267] COND TRUE disketteExtension__FloppyThread != 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L270] disketteExtension__FloppyThread = 0 [L271] Irp__IoStatus__Status = 0 [L272] myStatus = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L273] COND TRUE s == NP [L274] s = SKIP1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L281] Irp__CurrentLocation ++ [L282] Irp__Tail__Overlay__CurrentStackLocation ++ [L937] int returnVal2 ; [L938] int compRetStatus1 ; [L939] int lcontext = __VERIFIER_nondet_int() ; [L940] unsigned long __cil_tmp7 ; VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L943] COND FALSE !(\read(compRegistered)) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L956] int tmp_ndt_12; [L957] tmp_ndt_12 = __VERIFIER_nondet_int() [L958] COND TRUE tmp_ndt_12 == 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L969] returnVal2 = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L982] COND FALSE !(s == NP) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L986] COND FALSE !(s == MPR1) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L995] COND TRUE s == SKIP1 [L996] s = SKIP2 [L997] lowerDriverReturn = returnVal2 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1005] return (returnVal2); VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L283] ntStatus = IofCallDriver(disketteExtension__TargetObject, Irp) [L429] PagingReferenceCount -- VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L430] COND TRUE PagingReferenceCount == 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L433] return (ntStatus); VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L739] status = FloppyPnp(devobj, pirp) [L749] COND TRUE pended == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L750] COND FALSE !(s == NP) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L757] COND TRUE pended == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L758] COND FALSE !(s == MPR3) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L765] COND TRUE s != UNLOADED VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L766] COND TRUE status != -1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L767] COND FALSE !(s != SKIP2) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L781] COND TRUE pended == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L782] COND TRUE status != 259 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L64] __VERIFIER_error() VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 469 locations, 41 error locations. UNSAFE Result, 25.2s OverallTime, 38 OverallIterations, 1 TraceHistogramMax, 16.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 16119 SDtfs, 11963 SDslu, 20629 SDs, 0 SdLazy, 3351 SolverSat, 448 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 191 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=669occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 37 MinimizatonAttempts, 2714 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 1272 NumberOfCodeBlocks, 1272 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1180 ConstructedInterpolants, 0 QuantifiedInterpolants, 95152 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...