./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--input--gameport--ns558.ko-entry_point_true-unreach-call.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f 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/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--input--gameport--ns558.ko-entry_point_true-unreach-call.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash fccbb09b7d566d6e9c45a03f5671eecc50b127ec ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-15 14:38:24,961 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-15 14:38:24,963 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-15 14:38:24,976 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-15 14:38:24,977 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-15 14:38:24,978 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-15 14:38:24,980 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-15 14:38:24,983 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-15 14:38:24,986 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-15 14:38:24,987 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-15 14:38:24,995 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-15 14:38:24,996 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-15 14:38:24,997 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-15 14:38:24,997 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-15 14:38:25,001 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-15 14:38:25,001 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-15 14:38:25,003 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-15 14:38:25,004 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-15 14:38:25,006 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-15 14:38:25,008 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-15 14:38:25,009 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-15 14:38:25,010 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-15 14:38:25,013 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-15 14:38:25,013 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-15 14:38:25,014 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-15 14:38:25,015 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-15 14:38:25,016 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-15 14:38:25,017 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-15 14:38:25,017 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-15 14:38:25,019 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-15 14:38:25,019 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-15 14:38:25,020 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-15 14:38:25,020 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-15 14:38:25,020 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-15 14:38:25,022 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-15 14:38:25,022 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-15 14:38:25,023 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2019-01-15 14:38:25,038 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-15 14:38:25,039 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-15 14:38:25,040 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-15 14:38:25,040 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-15 14:38:25,041 INFO L133 SettingsManager]: * Use SBE=true [2019-01-15 14:38:25,041 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-15 14:38:25,041 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-15 14:38:25,041 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-15 14:38:25,041 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-15 14:38:25,042 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-15 14:38:25,043 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-15 14:38:25,043 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-15 14:38:25,043 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-15 14:38:25,043 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-15 14:38:25,044 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-15 14:38:25,044 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-15 14:38:25,045 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-15 14:38:25,045 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-15 14:38:25,045 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-15 14:38:25,045 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-15 14:38:25,045 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-15 14:38:25,045 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-15 14:38:25,046 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-15 14:38:25,046 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-15 14:38:25,046 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-15 14:38:25,046 INFO L133 SettingsManager]: * To the following directory=dump/ 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fccbb09b7d566d6e9c45a03f5671eecc50b127ec [2019-01-15 14:38:25,106 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-15 14:38:25,125 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-15 14:38:25,132 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-15 14:38:25,135 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-15 14:38:25,135 INFO L276 PluginConnector]: CDTParser initialized [2019-01-15 14:38:25,136 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--input--gameport--ns558.ko-entry_point_true-unreach-call.cil.out.i [2019-01-15 14:38:25,202 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9ab18087/ea46ad9b9eac4ea4b13d76e640a1972e/FLAGc28dd6d35 [2019-01-15 14:38:25,820 INFO L307 CDTParser]: Found 1 translation units. [2019-01-15 14:38:25,823 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--input--gameport--ns558.ko-entry_point_true-unreach-call.cil.out.i [2019-01-15 14:38:25,845 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9ab18087/ea46ad9b9eac4ea4b13d76e640a1972e/FLAGc28dd6d35 [2019-01-15 14:38:25,972 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9ab18087/ea46ad9b9eac4ea4b13d76e640a1972e [2019-01-15 14:38:25,975 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-15 14:38:25,976 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-15 14:38:25,977 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-15 14:38:25,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-15 14:38:25,981 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-15 14:38:25,981 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.01 02:38:25" (1/1) ... [2019-01-15 14:38:25,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@606f123a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 02:38:25, skipping insertion in model container [2019-01-15 14:38:25,985 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.01 02:38:25" (1/1) ... [2019-01-15 14:38:25,992 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-15 14:38:26,064 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-15 14:38:26,492 WARN L1127 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1323] [2019-01-15 14:38:26,493 WARN L1127 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1324-1325] [2019-01-15 14:38:27,005 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-15 14:38:27,044 INFO L191 MainTranslator]: Completed pre-run [2019-01-15 14:38:27,101 WARN L1127 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1323] [2019-01-15 14:38:27,102 WARN L1127 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1324-1325] [2019-01-15 14:38:27,219 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-15 14:38:27,314 INFO L195 MainTranslator]: Completed translation [2019-01-15 14:38:27,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 02:38:27 WrapperNode [2019-01-15 14:38:27,315 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-15 14:38:27,316 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-15 14:38:27,316 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-15 14:38:27,316 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-15 14:38:27,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 02:38:27" (1/1) ... [2019-01-15 14:38:27,355 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 02:38:27" (1/1) ... [2019-01-15 14:38:27,444 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-15 14:38:27,444 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-15 14:38:27,444 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-15 14:38:27,445 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-15 14:38:27,457 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 02:38:27" (1/1) ... [2019-01-15 14:38:27,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 02:38:27" (1/1) ... [2019-01-15 14:38:27,490 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 02:38:27" (1/1) ... [2019-01-15 14:38:27,491 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 02:38:27" (1/1) ... [2019-01-15 14:38:27,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 02:38:27" (1/1) ... [2019-01-15 14:38:27,549 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 02:38:27" (1/1) ... [2019-01-15 14:38:27,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 02:38:27" (1/1) ... [2019-01-15 14:38:27,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-15 14:38:27,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-15 14:38:27,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-15 14:38:27,580 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-15 14:38:27,581 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 02:38:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-15 14:38:27,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-15 14:38:27,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-15 14:38:27,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-15 14:38:27,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-15 14:38:27,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-15 14:38:27,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-15 14:38:27,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-15 14:38:27,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-15 14:38:27,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-15 14:38:27,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-15 14:38:27,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-15 14:38:30,339 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-15 14:38:30,339 INFO L286 CfgBuilder]: Removed 188 assue(true) statements. [2019-01-15 14:38:30,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.01 02:38:30 BoogieIcfgContainer [2019-01-15 14:38:30,341 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-15 14:38:30,342 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-15 14:38:30,342 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-15 14:38:30,346 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-15 14:38:30,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.01 02:38:25" (1/3) ... [2019-01-15 14:38:30,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@786e2956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.01 02:38:30, skipping insertion in model container [2019-01-15 14:38:30,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.01 02:38:27" (2/3) ... [2019-01-15 14:38:30,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@786e2956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.01 02:38:30, skipping insertion in model container [2019-01-15 14:38:30,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.01 02:38:30" (3/3) ... [2019-01-15 14:38:30,350 INFO L112 eAbstractionObserver]: Analyzing ICFG 43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--input--gameport--ns558.ko-entry_point_true-unreach-call.cil.out.i [2019-01-15 14:38:30,361 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-15 14:38:30,371 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-15 14:38:30,391 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-15 14:38:30,426 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-15 14:38:30,426 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-15 14:38:30,427 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-15 14:38:30,427 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-15 14:38:30,427 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-15 14:38:30,427 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-15 14:38:30,427 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-15 14:38:30,427 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-15 14:38:30,428 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-15 14:38:30,450 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states. [2019-01-15 14:38:30,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-15 14:38:30,461 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 14:38:30,462 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] [2019-01-15 14:38:30,464 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 14:38:30,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 14:38:30,471 INFO L82 PathProgramCache]: Analyzing trace with hash 671522750, now seen corresponding path program 1 times [2019-01-15 14:38:30,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 14:38:30,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 14:38:30,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 14:38:30,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 14:38:30,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 14:38:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 14:38:30,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 14:38:30,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 14:38:30,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-15 14:38:30,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-15 14:38:30,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-15 14:38:30,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-15 14:38:30,923 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 3 states. [2019-01-15 14:38:31,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 14:38:31,252 INFO L93 Difference]: Finished difference Result 425 states and 560 transitions. [2019-01-15 14:38:31,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-15 14:38:31,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-01-15 14:38:31,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 14:38:31,280 INFO L225 Difference]: With dead ends: 425 [2019-01-15 14:38:31,281 INFO L226 Difference]: Without dead ends: 243 [2019-01-15 14:38:31,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-15 14:38:31,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-01-15 14:38:31,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 239. [2019-01-15 14:38:31,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-01-15 14:38:31,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 310 transitions. [2019-01-15 14:38:31,396 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 310 transitions. Word has length 35 [2019-01-15 14:38:31,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 14:38:31,398 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 310 transitions. [2019-01-15 14:38:31,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-15 14:38:31,399 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 310 transitions. [2019-01-15 14:38:31,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-15 14:38:31,405 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 14:38:31,406 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] [2019-01-15 14:38:31,406 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 14:38:31,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 14:38:31,408 INFO L82 PathProgramCache]: Analyzing trace with hash -2098422314, now seen corresponding path program 1 times [2019-01-15 14:38:31,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 14:38:31,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 14:38:31,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 14:38:31,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 14:38:31,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 14:38:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 14:38:31,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-15 14:38:31,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 14:38:31,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-15 14:38:31,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-15 14:38:31,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-15 14:38:31,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-15 14:38:31,688 INFO L87 Difference]: Start difference. First operand 239 states and 310 transitions. Second operand 3 states. [2019-01-15 14:38:31,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 14:38:31,930 INFO L93 Difference]: Finished difference Result 591 states and 772 transitions. [2019-01-15 14:38:31,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-15 14:38:31,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-01-15 14:38:31,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 14:38:31,938 INFO L225 Difference]: With dead ends: 591 [2019-01-15 14:38:31,938 INFO L226 Difference]: Without dead ends: 363 [2019-01-15 14:38:31,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-15 14:38:31,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-01-15 14:38:31,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 243. [2019-01-15 14:38:31,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-01-15 14:38:31,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 314 transitions. [2019-01-15 14:38:31,998 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 314 transitions. Word has length 37 [2019-01-15 14:38:31,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 14:38:32,000 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 314 transitions. [2019-01-15 14:38:32,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-15 14:38:32,000 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 314 transitions. [2019-01-15 14:38:32,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-15 14:38:32,004 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 14:38:32,004 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] [2019-01-15 14:38:32,006 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 14:38:32,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 14:38:32,007 INFO L82 PathProgramCache]: Analyzing trace with hash 820333113, now seen corresponding path program 1 times [2019-01-15 14:38:32,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 14:38:32,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 14:38:32,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 14:38:32,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 14:38:32,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 14:38:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 14:38:32,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-15 14:38:32,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 14:38:32,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-15 14:38:32,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-15 14:38:32,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-15 14:38:32,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-15 14:38:32,184 INFO L87 Difference]: Start difference. First operand 243 states and 314 transitions. Second operand 3 states. [2019-01-15 14:38:32,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 14:38:32,294 INFO L93 Difference]: Finished difference Result 505 states and 653 transitions. [2019-01-15 14:38:32,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-15 14:38:32,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-01-15 14:38:32,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 14:38:32,299 INFO L225 Difference]: With dead ends: 505 [2019-01-15 14:38:32,299 INFO L226 Difference]: Without dead ends: 273 [2019-01-15 14:38:32,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-15 14:38:32,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-01-15 14:38:32,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 245. [2019-01-15 14:38:32,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-01-15 14:38:32,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 316 transitions. [2019-01-15 14:38:32,316 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 316 transitions. Word has length 44 [2019-01-15 14:38:32,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 14:38:32,317 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 316 transitions. [2019-01-15 14:38:32,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-15 14:38:32,317 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 316 transitions. [2019-01-15 14:38:32,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-15 14:38:32,319 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 14:38:32,319 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 14:38:32,319 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 14:38:32,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 14:38:32,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1566719398, now seen corresponding path program 1 times [2019-01-15 14:38:32,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 14:38:32,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 14:38:32,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 14:38:32,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 14:38:32,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 14:38:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 14:38:32,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-15 14:38:32,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 14:38:32,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-15 14:38:32,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-15 14:38:32,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-15 14:38:32,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-15 14:38:32,453 INFO L87 Difference]: Start difference. First operand 245 states and 316 transitions. Second operand 4 states. [2019-01-15 14:38:32,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 14:38:32,857 INFO L93 Difference]: Finished difference Result 1106 states and 1426 transitions. [2019-01-15 14:38:32,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-15 14:38:32,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-01-15 14:38:32,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 14:38:32,864 INFO L225 Difference]: With dead ends: 1106 [2019-01-15 14:38:32,864 INFO L226 Difference]: Without dead ends: 872 [2019-01-15 14:38:32,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-15 14:38:32,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2019-01-15 14:38:32,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 247. [2019-01-15 14:38:32,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-01-15 14:38:32,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 318 transitions. [2019-01-15 14:38:32,906 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 318 transitions. Word has length 47 [2019-01-15 14:38:32,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 14:38:32,906 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 318 transitions. [2019-01-15 14:38:32,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-15 14:38:32,907 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 318 transitions. [2019-01-15 14:38:32,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-15 14:38:32,908 INFO L394 BasicCegarLoop]: Found error trace [2019-01-15 14:38:32,909 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-15 14:38:32,909 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-15 14:38:32,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-15 14:38:32,910 INFO L82 PathProgramCache]: Analyzing trace with hash -886661028, now seen corresponding path program 1 times [2019-01-15 14:38:32,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-15 14:38:32,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-15 14:38:32,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 14:38:32,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-15 14:38:32,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-15 14:38:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-15 14:38:33,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-15 14:38:33,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-15 14:38:33,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-15 14:38:33,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-15 14:38:33,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-15 14:38:33,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-15 14:38:33,099 INFO L87 Difference]: Start difference. First operand 247 states and 318 transitions. Second operand 3 states. [2019-01-15 14:38:33,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-15 14:38:33,181 INFO L93 Difference]: Finished difference Result 247 states and 318 transitions. [2019-01-15 14:38:33,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-15 14:38:33,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-01-15 14:38:33,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-15 14:38:33,185 INFO L225 Difference]: With dead ends: 247 [2019-01-15 14:38:33,186 INFO L226 Difference]: Without dead ends: 0 [2019-01-15 14:38:33,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-15 14:38:33,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-15 14:38:33,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-15 14:38:33,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-15 14:38:33,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-15 14:38:33,191 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2019-01-15 14:38:33,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-15 14:38:33,191 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-15 14:38:33,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-15 14:38:33,191 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-15 14:38:33,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-15 14:38:33,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-15 14:38:34,069 INFO L448 ceAbstractionStarter]: For program point L1984(lines 1984 1988) no Hoare annotation was computed. [2019-01-15 14:38:34,069 INFO L448 ceAbstractionStarter]: For program point L1918(line 1918) no Hoare annotation was computed. [2019-01-15 14:38:34,069 INFO L448 ceAbstractionStarter]: For program point L1852(lines 1852 1856) no Hoare annotation was computed. [2019-01-15 14:38:34,069 INFO L448 ceAbstractionStarter]: For program point L1918-2(line 1918) no Hoare annotation was computed. [2019-01-15 14:38:34,070 INFO L444 ceAbstractionStarter]: At program point L1918-3(lines 1894 1920) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,070 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1529) no Hoare annotation was computed. [2019-01-15 14:38:34,070 INFO L448 ceAbstractionStarter]: For program point L1655(lines 1655 1659) no Hoare annotation was computed. [2019-01-15 14:38:34,070 INFO L448 ceAbstractionStarter]: For program point L2019(line 2019) no Hoare annotation was computed. [2019-01-15 14:38:34,070 INFO L448 ceAbstractionStarter]: For program point L1491(lines 1491 1498) no Hoare annotation was computed. [2019-01-15 14:38:34,070 INFO L448 ceAbstractionStarter]: For program point L1491-1(lines 1491 1498) no Hoare annotation was computed. [2019-01-15 14:38:34,071 INFO L448 ceAbstractionStarter]: For program point L2020(lines 2020 2033) no Hoare annotation was computed. [2019-01-15 14:38:34,071 INFO L444 ceAbstractionStarter]: At program point L1888(lines 1838 1890) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,071 INFO L444 ceAbstractionStarter]: At program point L1525(lines 2069 2078) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,071 INFO L444 ceAbstractionStarter]: At program point L1525-1(lines 2069 2078) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,071 INFO L444 ceAbstractionStarter]: At program point L1525-2(lines 2069 2078) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,071 INFO L444 ceAbstractionStarter]: At program point L1525-3(lines 2069 2078) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,071 INFO L444 ceAbstractionStarter]: At program point L2186(lines 2185 2187) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,071 INFO L444 ceAbstractionStarter]: At program point L2186-1(lines 2185 2187) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,072 INFO L448 ceAbstractionStarter]: For program point L2022(lines 2022 2026) no Hoare annotation was computed. [2019-01-15 14:38:34,072 INFO L448 ceAbstractionStarter]: For program point L2022-2(lines 2020 2032) no Hoare annotation was computed. [2019-01-15 14:38:34,072 INFO L448 ceAbstractionStarter]: For program point L1758(lines 1758 1761) no Hoare annotation was computed. [2019-01-15 14:38:34,072 INFO L448 ceAbstractionStarter]: For program point L1692(lines 1692 1695) no Hoare annotation was computed. [2019-01-15 14:38:34,072 INFO L448 ceAbstractionStarter]: For program point L1758-2(lines 1758 1761) no Hoare annotation was computed. [2019-01-15 14:38:34,072 INFO L444 ceAbstractionStarter]: At program point L1593(lines 1589 1595) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,072 INFO L444 ceAbstractionStarter]: At program point L1593-1(lines 1589 1595) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,072 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 1529) no Hoare annotation was computed. [2019-01-15 14:38:34,073 INFO L444 ceAbstractionStarter]: At program point L1660(lines 1645 1662) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,073 INFO L448 ceAbstractionStarter]: For program point L1561(lines 1561 1564) no Hoare annotation was computed. [2019-01-15 14:38:34,073 INFO L448 ceAbstractionStarter]: For program point L1528(line 1528) no Hoare annotation was computed. [2019-01-15 14:38:34,073 INFO L448 ceAbstractionStarter]: For program point L1528-1(line 1528) no Hoare annotation was computed. [2019-01-15 14:38:34,073 INFO L448 ceAbstractionStarter]: For program point L1528-2(line 1528) no Hoare annotation was computed. [2019-01-15 14:38:34,073 INFO L444 ceAbstractionStarter]: At program point L1429(lines 1426 1431) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,073 INFO L448 ceAbstractionStarter]: For program point L1528-3(line 1528) no Hoare annotation was computed. [2019-01-15 14:38:34,073 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 1529) no Hoare annotation was computed. [2019-01-15 14:38:34,074 INFO L444 ceAbstractionStarter]: At program point L2156(lines 2155 2157) the Hoare annotation is: (and (= ~ldv_state_variable_1~0 0) (= ~ldv_spin~0 0)) [2019-01-15 14:38:34,074 INFO L448 ceAbstractionStarter]: For program point L1628(lines 1628 1631) no Hoare annotation was computed. [2019-01-15 14:38:34,074 INFO L444 ceAbstractionStarter]: At program point L2190(lines 2189 2191) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,074 INFO L444 ceAbstractionStarter]: At program point L2190-2(lines 2189 2191) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,074 INFO L444 ceAbstractionStarter]: At program point L2190-1(lines 2189 2191) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,074 INFO L444 ceAbstractionStarter]: At program point L2190-4(lines 2189 2191) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,074 INFO L444 ceAbstractionStarter]: At program point L2190-3(lines 2189 2191) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,074 INFO L444 ceAbstractionStarter]: At program point L2190-6(lines 2189 2191) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,075 INFO L448 ceAbstractionStarter]: For program point L1992(line 1992) no Hoare annotation was computed. [2019-01-15 14:38:34,075 INFO L444 ceAbstractionStarter]: At program point L2190-5(lines 2189 2191) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,075 INFO L448 ceAbstractionStarter]: For program point L1794(lines 1794 1801) no Hoare annotation was computed. [2019-01-15 14:38:34,075 INFO L444 ceAbstractionStarter]: At program point L1497(lines 1484 1500) the Hoare annotation is: (and (= ~ldv_state_variable_1~0 0) (= ~ldv_spin~0 0)) [2019-01-15 14:38:34,075 INFO L444 ceAbstractionStarter]: At program point L1497-1(lines 1484 1500) the Hoare annotation is: (and (= ~ldv_state_variable_1~0 0) (= ~ldv_spin~0 0)) [2019-01-15 14:38:34,075 INFO L448 ceAbstractionStarter]: For program point L1993(lines 1993 1998) no Hoare annotation was computed. [2019-01-15 14:38:34,075 INFO L448 ceAbstractionStarter]: For program point L1729(lines 1729 1734) no Hoare annotation was computed. [2019-01-15 14:38:34,076 INFO L444 ceAbstractionStarter]: At program point L1763(lines 1689 1811) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,076 INFO L444 ceAbstractionStarter]: At program point L2193-1(lines 1 2195) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,076 INFO L444 ceAbstractionStarter]: At program point L2160(lines 2159 2161) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,076 INFO L448 ceAbstractionStarter]: For program point L2193(lines 2193 2195) no Hoare annotation was computed. [2019-01-15 14:38:34,076 INFO L448 ceAbstractionStarter]: For program point L2193-3(lines 2193 2195) no Hoare annotation was computed. [2019-01-15 14:38:34,076 INFO L448 ceAbstractionStarter]: For program point L2193-2(lines 2193 2195) no Hoare annotation was computed. [2019-01-15 14:38:34,076 INFO L444 ceAbstractionStarter]: At program point L2193-4(lines 1 2195) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,076 INFO L448 ceAbstractionStarter]: For program point L1863(lines 1863 1866) no Hoare annotation was computed. [2019-01-15 14:38:34,077 INFO L444 ceAbstractionStarter]: At program point L1632(lines 1619 1634) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,077 INFO L444 ceAbstractionStarter]: At program point L1566(lines 1557 1568) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,077 INFO L451 ceAbstractionStarter]: At program point L2029(lines 1 2195) the Hoare annotation is: true [2019-01-15 14:38:34,077 INFO L444 ceAbstractionStarter]: At program point L1765(lines 1689 1811) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,077 INFO L448 ceAbstractionStarter]: For program point L1600(lines 1600 1603) no Hoare annotation was computed. [2019-01-15 14:38:34,077 INFO L448 ceAbstractionStarter]: For program point L1600-1(lines 1600 1603) no Hoare annotation was computed. [2019-01-15 14:38:34,077 INFO L448 ceAbstractionStarter]: For program point L1600-2(lines 1600 1603) no Hoare annotation was computed. [2019-01-15 14:38:34,077 INFO L448 ceAbstractionStarter]: For program point L1700(lines 1700 1705) no Hoare annotation was computed. [2019-01-15 14:38:34,077 INFO L451 ceAbstractionStarter]: At program point L1535(lines 1534 1537) the Hoare annotation is: true [2019-01-15 14:38:34,078 INFO L451 ceAbstractionStarter]: At program point L1535-1(lines 1534 1537) the Hoare annotation is: true [2019-01-15 14:38:34,078 INFO L451 ceAbstractionStarter]: At program point L1535-2(lines 1534 1537) the Hoare annotation is: true [2019-01-15 14:38:34,078 INFO L444 ceAbstractionStarter]: At program point L2130(lines 2129 2131) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,078 INFO L444 ceAbstractionStarter]: At program point L2064(lines 2060 2066) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,078 INFO L444 ceAbstractionStarter]: At program point L2130-1(lines 2129 2131) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,080 INFO L444 ceAbstractionStarter]: At program point L2064-1(lines 2060 2066) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,080 INFO L444 ceAbstractionStarter]: At program point L2064-2(lines 2060 2066) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,081 INFO L444 ceAbstractionStarter]: At program point L2064-3(lines 2060 2066) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,081 INFO L448 ceAbstractionStarter]: For program point L2000(line 2000) no Hoare annotation was computed. [2019-01-15 14:38:34,081 INFO L444 ceAbstractionStarter]: At program point L1736(lines 1689 1811) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,081 INFO L444 ceAbstractionStarter]: At program point L1604(lines 1597 1606) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,081 INFO L444 ceAbstractionStarter]: At program point L1604-1(lines 1597 1606) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,081 INFO L444 ceAbstractionStarter]: At program point L1604-2(lines 1597 1606) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,081 INFO L444 ceAbstractionStarter]: At program point L1439(lines 1435 1441) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,081 INFO L444 ceAbstractionStarter]: At program point L1439-1(lines 1435 1441) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,082 INFO L444 ceAbstractionStarter]: At program point L1439-2(lines 1435 1441) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,082 INFO L444 ceAbstractionStarter]: At program point L1439-3(lines 1435 1441) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,082 INFO L444 ceAbstractionStarter]: At program point L1439-4(lines 1435 1441) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,082 INFO L444 ceAbstractionStarter]: At program point L2133-1(lines 2132 2134) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,082 INFO L444 ceAbstractionStarter]: At program point L2133(lines 2132 2134) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,082 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-15 14:38:34,082 INFO L444 ceAbstractionStarter]: At program point L2167-1(lines 1769 1773) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,082 INFO L444 ceAbstractionStarter]: At program point L2167(lines 2166 2168) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,083 INFO L448 ceAbstractionStarter]: For program point L2035(line 2035) no Hoare annotation was computed. [2019-01-15 14:38:34,083 INFO L448 ceAbstractionStarter]: For program point L1903(lines 1903 1906) no Hoare annotation was computed. [2019-01-15 14:38:34,083 INFO L448 ceAbstractionStarter]: For program point L1870(lines 1870 1876) no Hoare annotation was computed. [2019-01-15 14:38:34,083 INFO L444 ceAbstractionStarter]: At program point L1738(lines 1689 1811) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,083 INFO L444 ceAbstractionStarter]: At program point L1408(lines 1404 1410) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,083 INFO L451 ceAbstractionStarter]: At program point L2136(lines 2135 2137) the Hoare annotation is: true [2019-01-15 14:38:34,083 INFO L444 ceAbstractionStarter]: At program point L2136-2(lines 2135 2137) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,083 INFO L444 ceAbstractionStarter]: At program point L2136-1(lines 2135 2137) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,083 INFO L444 ceAbstractionStarter]: At program point L2136-4(lines 2135 2137) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,084 INFO L444 ceAbstractionStarter]: At program point L2136-3(lines 2135 2137) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,087 INFO L444 ceAbstractionStarter]: At program point L2136-6(lines 2135 2137) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,087 INFO L444 ceAbstractionStarter]: At program point L1642(lines 1635 1644) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,087 INFO L444 ceAbstractionStarter]: At program point L2171-1(lines 2170 2172) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,087 INFO L444 ceAbstractionStarter]: At program point L2171(lines 2170 2172) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,087 INFO L444 ceAbstractionStarter]: At program point L2171-2(lines 2170 2172) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,088 INFO L448 ceAbstractionStarter]: For program point L2072(lines 2072 2075) no Hoare annotation was computed. [2019-01-15 14:38:34,088 INFO L448 ceAbstractionStarter]: For program point L2072-2(lines 2072 2075) no Hoare annotation was computed. [2019-01-15 14:38:34,088 INFO L448 ceAbstractionStarter]: For program point L2072-4(lines 2072 2075) no Hoare annotation was computed. [2019-01-15 14:38:34,088 INFO L448 ceAbstractionStarter]: For program point L2072-6(lines 2072 2075) no Hoare annotation was computed. [2019-01-15 14:38:34,088 INFO L444 ceAbstractionStarter]: At program point L1775(lines 1689 1811) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,088 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-15 14:38:34,088 INFO L448 ceAbstractionStarter]: For program point L2007(line 2007) no Hoare annotation was computed. [2019-01-15 14:38:34,088 INFO L448 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-01-15 14:38:34,088 INFO L448 ceAbstractionStarter]: For program point L1611-2(lines 1611 1614) no Hoare annotation was computed. [2019-01-15 14:38:34,089 INFO L444 ceAbstractionStarter]: At program point L2140(lines 2139 2141) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,089 INFO L444 ceAbstractionStarter]: At program point L2140-2(lines 2139 2141) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,089 INFO L444 ceAbstractionStarter]: At program point L2140-1(lines 2139 2141) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,089 INFO L448 ceAbstractionStarter]: For program point L2008(lines 2008 2040) no Hoare annotation was computed. [2019-01-15 14:38:34,089 INFO L444 ceAbstractionStarter]: At program point L2140-3(lines 2139 2141) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,089 INFO L451 ceAbstractionStarter]: At program point L1942(lines 1928 1949) the Hoare annotation is: true [2019-01-15 14:38:34,089 INFO L444 ceAbstractionStarter]: At program point L1810(lines 1671 1812) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,089 INFO L444 ceAbstractionStarter]: At program point L1777(lines 1689 1811) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,090 INFO L444 ceAbstractionStarter]: At program point L1579(lines 1572 1581) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,095 INFO L444 ceAbstractionStarter]: At program point L1579-1(lines 1572 1581) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,095 INFO L444 ceAbstractionStarter]: At program point L1447(lines 1442 1449) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,095 INFO L444 ceAbstractionStarter]: At program point L1447-1(lines 1442 1449) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,095 INFO L444 ceAbstractionStarter]: At program point L1447-2(lines 1442 1449) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,095 INFO L444 ceAbstractionStarter]: At program point L1447-3(lines 1442 1449) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,096 INFO L444 ceAbstractionStarter]: At program point L1447-4(lines 1442 1449) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,096 INFO L444 ceAbstractionStarter]: At program point L1447-5(lines 1442 1449) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,096 INFO L444 ceAbstractionStarter]: At program point L1447-6(lines 1442 1449) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,096 INFO L448 ceAbstractionStarter]: For program point L2042(line 2042) no Hoare annotation was computed. [2019-01-15 14:38:34,096 INFO L448 ceAbstractionStarter]: For program point L1976(lines 1976 2044) no Hoare annotation was computed. [2019-01-15 14:38:34,096 INFO L444 ceAbstractionStarter]: At program point L1712(lines 1689 1811) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,096 INFO L444 ceAbstractionStarter]: At program point L1415(lines 1411 1417) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,096 INFO L444 ceAbstractionStarter]: At program point L2175(lines 2174 2176) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,096 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-15 14:38:34,097 INFO L448 ceAbstractionStarter]: For program point L2010(lines 2010 2037) no Hoare annotation was computed. [2019-01-15 14:38:34,097 INFO L448 ceAbstractionStarter]: For program point L1977(line 1977) no Hoare annotation was computed. [2019-01-15 14:38:34,097 INFO L451 ceAbstractionStarter]: At program point L1944(lines 1928 1949) the Hoare annotation is: true [2019-01-15 14:38:34,097 INFO L448 ceAbstractionStarter]: For program point L2011(line 2011) no Hoare annotation was computed. [2019-01-15 14:38:34,097 INFO L448 ceAbstractionStarter]: For program point L1978(lines 1978 2005) no Hoare annotation was computed. [2019-01-15 14:38:34,097 INFO L444 ceAbstractionStarter]: At program point L1912(lines 1900 1919) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,097 INFO L444 ceAbstractionStarter]: At program point L1780(lines 1780 1781) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,097 INFO L448 ceAbstractionStarter]: For program point L1747(lines 1747 1750) no Hoare annotation was computed. [2019-01-15 14:38:34,098 INFO L444 ceAbstractionStarter]: At program point L1714(lines 1689 1811) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,100 INFO L444 ceAbstractionStarter]: At program point L2045(lines 1965 2050) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,100 INFO L448 ceAbstractionStarter]: For program point L2012(lines 2012 2017) no Hoare annotation was computed. [2019-01-15 14:38:34,100 INFO L448 ceAbstractionStarter]: For program point L1913(lines 1913 1916) no Hoare annotation was computed. [2019-01-15 14:38:34,100 INFO L444 ceAbstractionStarter]: At program point L1616(lines 1607 1618) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,100 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 1529) no Hoare annotation was computed. [2019-01-15 14:38:34,101 INFO L451 ceAbstractionStarter]: At program point L2178(lines 1 2195) the Hoare annotation is: true [2019-01-15 14:38:34,101 INFO L448 ceAbstractionStarter]: For program point L1980(lines 1980 2002) no Hoare annotation was computed. [2019-01-15 14:38:34,101 INFO L444 ceAbstractionStarter]: At program point L1914(lines 1900 1919) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,101 INFO L448 ceAbstractionStarter]: For program point L1782(lines 1782 1790) no Hoare annotation was computed. [2019-01-15 14:38:34,101 INFO L448 ceAbstractionStarter]: For program point L1782-2(lines 1782 1790) no Hoare annotation was computed. [2019-01-15 14:38:34,101 INFO L451 ceAbstractionStarter]: At program point L2146(lines 2145 2147) the Hoare annotation is: true [2019-01-15 14:38:34,101 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-15 14:38:34,101 INFO L444 ceAbstractionStarter]: At program point L-1-2(line -1) the Hoare annotation is: (and (= ~ldv_state_variable_1~0 0) (= ~ldv_spin~0 0)) [2019-01-15 14:38:34,102 INFO L448 ceAbstractionStarter]: For program point L1981(line 1981) no Hoare annotation was computed. [2019-01-15 14:38:34,102 INFO L448 ceAbstractionStarter]: For program point L-1-3(line -1) no Hoare annotation was computed. [2019-01-15 14:38:34,102 INFO L444 ceAbstractionStarter]: At program point L-1-5(line -1) the Hoare annotation is: (and (= ~ldv_state_variable_1~0 0) (= ~ldv_spin~0 0)) [2019-01-15 14:38:34,102 INFO L448 ceAbstractionStarter]: For program point L-1-6(line -1) no Hoare annotation was computed. [2019-01-15 14:38:34,102 INFO L448 ceAbstractionStarter]: For program point L1717(lines 1717 1722) no Hoare annotation was computed. [2019-01-15 14:38:34,102 INFO L444 ceAbstractionStarter]: At program point L1453(lines 1450 1455) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,102 INFO L448 ceAbstractionStarter]: For program point L1982(lines 1982 1990) no Hoare annotation was computed. [2019-01-15 14:38:34,102 INFO L444 ceAbstractionStarter]: At program point L1421(lines 1418 1423) the Hoare annotation is: (= ~ldv_spin~0 0) [2019-01-15 14:38:34,103 INFO L451 ceAbstractionStarter]: At program point L2049(lines 1956 2051) the Hoare annotation is: true [2019-01-15 14:38:34,111 INFO L448 ceAbstractionStarter]: For program point L1785(lines 1785 1788) no Hoare annotation was computed. [2019-01-15 14:38:34,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.01 02:38:34 BoogieIcfgContainer [2019-01-15 14:38:34,152 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-15 14:38:34,152 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-15 14:38:34,152 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-15 14:38:34,153 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-15 14:38:34,153 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.01 02:38:30" (3/4) ... [2019-01-15 14:38:34,160 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-15 14:38:34,190 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 103 nodes and edges [2019-01-15 14:38:34,192 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 40 nodes and edges [2019-01-15 14:38:34,195 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-01-15 14:38:34,499 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-15 14:38:34,499 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-15 14:38:34,505 INFO L168 Benchmark]: Toolchain (without parser) took 8529.98 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 224.4 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -118.6 MB). Peak memory consumption was 105.8 MB. Max. memory is 11.5 GB. [2019-01-15 14:38:34,509 INFO L168 Benchmark]: CDTParser took 0.15 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. [2019-01-15 14:38:34,509 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1338.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -140.2 MB). Peak memory consumption was 47.8 MB. Max. memory is 11.5 GB. [2019-01-15 14:38:34,511 INFO L168 Benchmark]: Boogie Procedure Inliner took 128.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2019-01-15 14:38:34,511 INFO L168 Benchmark]: Boogie Preprocessor took 134.32 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. [2019-01-15 14:38:34,511 INFO L168 Benchmark]: RCFGBuilder took 2762.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 954.4 MB in the end (delta: 117.6 MB). Peak memory consumption was 117.6 MB. Max. memory is 11.5 GB. [2019-01-15 14:38:34,511 INFO L168 Benchmark]: TraceAbstraction took 3809.80 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 94.4 MB). Free memory was 954.4 MB in the beginning and 1.2 GB in the end (delta: -205.5 MB). Peak memory consumption was 194.3 MB. Max. memory is 11.5 GB. [2019-01-15 14:38:34,512 INFO L168 Benchmark]: Witness Printer took 346.70 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 95.3 MB). Peak memory consumption was 95.3 MB. Max. memory is 11.5 GB. [2019-01-15 14:38:34,514 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.15 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 1338.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -140.2 MB). Peak memory consumption was 47.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 128.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 134.32 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 2762.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 954.4 MB in the end (delta: 117.6 MB). Peak memory consumption was 117.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3809.80 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 94.4 MB). Free memory was 954.4 MB in the beginning and 1.2 GB in the end (delta: -205.5 MB). Peak memory consumption was 194.3 MB. Max. memory is 11.5 GB. * Witness Printer took 346.70 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 95.3 MB). Peak memory consumption was 95.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1529]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1529]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1529]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1529]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 2189]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2145]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1900]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2189]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2189]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2189]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1572]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2189]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1534]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1572]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1671]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1689]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1689]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2139]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1928]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1404]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1635]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2139]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2139]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2139]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1956]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1689]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1900]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1418]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2166]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1928]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1769]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2155]: Loop Invariant Derived loop invariant: ldv_state_variable_1 == 0 && ldv_spin == 0 - InvariantResult [Line: 2185]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1689]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1426]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2185]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2174]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2069]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2135]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2069]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2135]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1411]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2069]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1645]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1607]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2135]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2135]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2135]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2069]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2135]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2132]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1557]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1965]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1689]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1484]: Loop Invariant Derived loop invariant: ldv_state_variable_1 == 0 && ldv_spin == 0 - InvariantResult [Line: 2060]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1450]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1484]: Loop Invariant Derived loop invariant: ldv_state_variable_1 == 0 && ldv_spin == 0 - InvariantResult [Line: 2060]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1619]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1838]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2132]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1435]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1435]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2129]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1894]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1435]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1435]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2129]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1689]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2060]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2060]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1589]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1597]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1442]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ldv_state_variable_1 == 0 && ldv_spin == 0 - InvariantResult [Line: 1597]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1442]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2170]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1589]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1597]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1442]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1442]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ldv_state_variable_1 == 0 && ldv_spin == 0 - InvariantResult [Line: 1435]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1780]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1534]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2189]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1534]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1689]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1442]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1689]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2189]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2170]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1442]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2170]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1442]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 2159]: Loop Invariant Derived loop invariant: ldv_spin == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ldv_spin == 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 168 locations, 4 error locations. SAFE Result, 3.6s OverallTime, 5 OverallIterations, 2 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 1398 SDtfs, 909 SDslu, 1207 SDs, 0 SdLazy, 77 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=4, 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: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 777 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 98 LocationsWithAnnotation, 98 PreInvPairs, 259 NumberOfFragments, 294 HoareAnnotationTreeSize, 98 FomulaSimplifications, 2699 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 98 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 210 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 205 ConstructedInterpolants, 0 QuantifiedInterpolants, 13219 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 6/6 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...