./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector-loops/diamond_false-unreach-call2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_27288ea6-d02f-4568-86d1-24362eb04c02/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_27288ea6-d02f-4568-86d1-24362eb04c02/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_27288ea6-d02f-4568-86d1-24362eb04c02/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_27288ea6-d02f-4568-86d1-24362eb04c02/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector-loops/diamond_false-unreach-call2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_27288ea6-d02f-4568-86d1-24362eb04c02/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_27288ea6-d02f-4568-86d1-24362eb04c02/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dee4f98e3deb83265bbf70c3b5c0f3c1ff37b06c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.23-aa41828 [2018-11-23 15:26:06,745 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:26:06,746 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:26:06,754 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:26:06,754 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:26:06,755 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:26:06,756 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:26:06,757 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:26:06,758 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:26:06,759 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:26:06,760 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:26:06,760 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:26:06,760 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:26:06,761 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:26:06,762 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:26:06,763 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:26:06,764 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:26:06,765 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:26:06,767 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:26:06,768 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:26:06,769 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:26:06,771 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:26:06,772 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:26:06,773 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:26:06,773 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:26:06,774 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:26:06,775 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:26:06,776 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:26:06,776 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:26:06,778 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:26:06,778 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:26:06,778 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:26:06,779 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:26:06,779 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:26:06,780 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:26:06,780 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:26:06,780 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_27288ea6-d02f-4568-86d1-24362eb04c02/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 15:26:06,792 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:26:06,792 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:26:06,793 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 15:26:06,793 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 15:26:06,793 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 15:26:06,794 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 15:26:06,794 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 15:26:06,794 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 15:26:06,794 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 15:26:06,795 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 15:26:06,795 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 15:26:06,795 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 15:26:06,795 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 15:26:06,795 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:26:06,796 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 15:26:06,796 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:26:06,796 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 15:26:06,796 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:26:06,796 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 15:26:06,797 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 15:26:06,797 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 15:26:06,797 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 15:26:06,797 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:26:06,797 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:26:06,799 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 15:26:06,799 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:26:06,799 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:26:06,799 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 15:26:06,799 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 15:26:06,799 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 15:26:06,799 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:26:06,800 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 15:26:06,800 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 15:26:06,800 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 15:26:06,800 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 15:26:06,800 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 15:26:06,800 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 15:26:06,800 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_27288ea6-d02f-4568-86d1-24362eb04c02/bin-2019/utaipan 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 -> Taipan 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 -> dee4f98e3deb83265bbf70c3b5c0f3c1ff37b06c [2018-11-23 15:26:06,827 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:26:06,836 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:26:06,838 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:26:06,840 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:26:06,840 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:26:06,840 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_27288ea6-d02f-4568-86d1-24362eb04c02/bin-2019/utaipan/../../sv-benchmarks/c/bitvector-loops/diamond_false-unreach-call2.i [2018-11-23 15:26:06,882 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_27288ea6-d02f-4568-86d1-24362eb04c02/bin-2019/utaipan/data/f291d55f1/1be2314d3a824be4855a4c4f92ff32be/FLAG209947186 [2018-11-23 15:26:07,220 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:26:07,221 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_27288ea6-d02f-4568-86d1-24362eb04c02/sv-benchmarks/c/bitvector-loops/diamond_false-unreach-call2.i [2018-11-23 15:26:07,225 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_27288ea6-d02f-4568-86d1-24362eb04c02/bin-2019/utaipan/data/f291d55f1/1be2314d3a824be4855a4c4f92ff32be/FLAG209947186 [2018-11-23 15:26:07,645 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_27288ea6-d02f-4568-86d1-24362eb04c02/bin-2019/utaipan/data/f291d55f1/1be2314d3a824be4855a4c4f92ff32be [2018-11-23 15:26:07,649 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:26:07,650 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:26:07,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:26:07,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:26:07,654 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:26:07,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:26:07" (1/1) ... [2018-11-23 15:26:07,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6598bea9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:26:07, skipping insertion in model container [2018-11-23 15:26:07,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:26:07" (1/1) ... [2018-11-23 15:26:07,665 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:26:07,680 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:26:07,835 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:26:07,838 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:26:07,857 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:26:07,869 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:26:07,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:26:07 WrapperNode [2018-11-23 15:26:07,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:26:07,870 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:26:07,870 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:26:07,870 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:26:07,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:26:07" (1/1) ... [2018-11-23 15:26:07,880 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:26:07" (1/1) ... [2018-11-23 15:26:07,887 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:26:07,887 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:26:07,888 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:26:07,888 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:26:07,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:26:07" (1/1) ... [2018-11-23 15:26:07,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:26:07" (1/1) ... [2018-11-23 15:26:07,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:26:07" (1/1) ... [2018-11-23 15:26:07,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:26:07" (1/1) ... [2018-11-23 15:26:07,902 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:26:07" (1/1) ... [2018-11-23 15:26:07,908 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:26:07" (1/1) ... [2018-11-23 15:26:07,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:26:07" (1/1) ... [2018-11-23 15:26:07,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:26:07,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:26:07,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:26:07,911 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:26:07,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:26:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27288ea6-d02f-4568-86d1-24362eb04c02/bin-2019/utaipan/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-11-23 15:26:08,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 15:26:08,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 15:26:08,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:26:08,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:26:08,011 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 15:26:08,011 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 15:26:08,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 15:26:08,011 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 15:26:08,205 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:26:08,206 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 15:26:08,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:26:08 BoogieIcfgContainer [2018-11-23 15:26:08,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:26:08,207 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 15:26:08,207 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 15:26:08,211 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 15:26:08,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:26:07" (1/3) ... [2018-11-23 15:26:08,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7702c53e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:26:08, skipping insertion in model container [2018-11-23 15:26:08,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:26:07" (2/3) ... [2018-11-23 15:26:08,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7702c53e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:26:08, skipping insertion in model container [2018-11-23 15:26:08,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:26:08" (3/3) ... [2018-11-23 15:26:08,216 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_false-unreach-call2.i [2018-11-23 15:26:08,227 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 15:26:08,236 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 15:26:08,254 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 15:26:08,285 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 15:26:08,286 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 15:26:08,286 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 15:26:08,286 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:26:08,286 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:26:08,286 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 15:26:08,286 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:26:08,286 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 15:26:08,304 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-23 15:26:08,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 15:26:08,310 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:26:08,311 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:26:08,313 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:26:08,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:26:08,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1906239810, now seen corresponding path program 1 times [2018-11-23 15:26:08,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:26:08,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:26:08,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:26:08,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:26:08,366 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:26:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:26:08,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:26:08,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:26:08,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 15:26:08,413 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:26:08,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 15:26:08,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 15:26:08,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 15:26:08,427 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-23 15:26:08,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:26:08,447 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2018-11-23 15:26:08,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 15:26:08,449 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 15:26:08,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:26:08,455 INFO L225 Difference]: With dead ends: 38 [2018-11-23 15:26:08,456 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 15:26:08,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 15:26:08,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 15:26:08,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 15:26:08,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 15:26:08,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2018-11-23 15:26:08,481 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 10 [2018-11-23 15:26:08,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:26:08,482 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2018-11-23 15:26:08,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 15:26:08,482 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2018-11-23 15:26:08,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 15:26:08,482 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:26:08,483 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:26:08,483 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:26:08,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:26:08,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1847134466, now seen corresponding path program 1 times [2018-11-23 15:26:08,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:26:08,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:26:08,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:26:08,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:26:08,484 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:26:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:26:08,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-11-23 15:26:08,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:26:08,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:26:08,570 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:26:08,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:26:08,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:26:08,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:26:08,572 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand 3 states. [2018-11-23 15:26:08,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:26:08,627 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2018-11-23 15:26:08,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:26:08,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 15:26:08,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:26:08,629 INFO L225 Difference]: With dead ends: 28 [2018-11-23 15:26:08,629 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 15:26:08,629 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 [2018-11-23 15:26:08,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 15:26:08,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-11-23 15:26:08,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 15:26:08,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2018-11-23 15:26:08,633 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 10 [2018-11-23 15:26:08,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:26:08,633 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2018-11-23 15:26:08,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:26:08,634 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2018-11-23 15:26:08,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 15:26:08,634 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:26:08,634 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] [2018-11-23 15:26:08,634 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:26:08,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:26:08,635 INFO L82 PathProgramCache]: Analyzing trace with hash -129940435, now seen corresponding path program 1 times [2018-11-23 15:26:08,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:26:08,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:26:08,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:26:08,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:26:08,636 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:26:08,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:26:08,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:26:08,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:26:08,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:26:08,712 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:26:08,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:26:08,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:26:08,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:26:08,713 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 3 states. [2018-11-23 15:26:08,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:26:08,798 INFO L93 Difference]: Finished difference Result 50 states and 81 transitions. [2018-11-23 15:26:08,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:26:08,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 15:26:08,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:26:08,800 INFO L225 Difference]: With dead ends: 50 [2018-11-23 15:26:08,800 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 15:26:08,801 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-11-23 15:26:08,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 15:26:08,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 15:26:08,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 15:26:08,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2018-11-23 15:26:08,807 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 21 [2018-11-23 15:26:08,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:26:08,807 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2018-11-23 15:26:08,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:26:08,808 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2018-11-23 15:26:08,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 15:26:08,808 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:26:08,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] [2018-11-23 15:26:08,808 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:26:08,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:26:08,809 INFO L82 PathProgramCache]: Analyzing trace with hash 263086575, now seen corresponding path program 1 times [2018-11-23 15:26:08,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:26:08,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:26:08,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:26:08,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:26:08,811 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:26:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:26:09,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:26:09,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:26:09,020 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 15:26:09,021 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-11-23 15:26:09,022 INFO L202 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [22], [28], [34], [40], [46], [52], [58], [64], [70], [79], [82], [84], [90], [91], [92], [94] [2018-11-23 15:26:09,050 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 15:26:09,051 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 15:26:09,342 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 15:26:09,343 INFO L272 AbstractInterpreter]: Visited 21 different actions 53 times. Merged at 12 different actions 26 times. Never widened. Performed 214 root evaluator evaluations with a maximum evaluation depth of 13. Performed 214 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2018-11-23 15:26:09,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:26:09,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 15:26:09,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:26:09,355 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27288ea6-d02f-4568-86d1-24362eb04c02/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:26:09,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:26:09,364 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 15:26:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:26:09,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:26:09,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:26:09,439 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:26:10,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:26:10,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 15:26:10,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-11-23 15:26:10,606 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 15:26:10,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 15:26:10,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 15:26:10,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2018-11-23 15:26:10,607 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 14 states. [2018-11-23 15:26:10,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:26:10,798 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2018-11-23 15:26:10,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 15:26:10,799 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2018-11-23 15:26:10,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:26:10,799 INFO L225 Difference]: With dead ends: 51 [2018-11-23 15:26:10,800 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 15:26:10,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2018-11-23 15:26:10,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 15:26:10,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-11-23 15:26:10,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 15:26:10,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2018-11-23 15:26:10,807 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 21 [2018-11-23 15:26:10,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:26:10,808 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2018-11-23 15:26:10,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 15:26:10,808 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2018-11-23 15:26:10,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 15:26:10,809 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:26:10,809 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] [2018-11-23 15:26:10,809 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:26:10,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:26:10,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1016777103, now seen corresponding path program 1 times [2018-11-23 15:26:10,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:26:10,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:26:10,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:26:10,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:26:10,811 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:26:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:26:12,843 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse1 (* 2 .cse4))) (let ((.cse2 (* (- 2) .cse4)) (.cse0 (= .cse1 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or .cse0 (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2 (- 2)) 4294967296)) 2) c_main_~y~0)) (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2) 4294967296))) c_main_~y~0)) (and (not .cse0) (< c_main_~y~0 .cse3))))))) is different from false [2018-11-23 15:26:12,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:26:12,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:26:12,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:26:12,847 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:26:12,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:26:12,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:26:12,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-23 15:26:12,848 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 3 states. [2018-11-23 15:26:12,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:26:12,852 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2018-11-23 15:26:12,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:26:12,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 15:26:12,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:26:12,853 INFO L225 Difference]: With dead ends: 60 [2018-11-23 15:26:12,853 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 15:26:12,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-23 15:26:12,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 15:26:12,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-23 15:26:12,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 15:26:12,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2018-11-23 15:26:12,858 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 21 [2018-11-23 15:26:12,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:26:12,859 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2018-11-23 15:26:12,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:26:12,859 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2018-11-23 15:26:12,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 15:26:12,859 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:26:12,860 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] [2018-11-23 15:26:12,860 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:26:12,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:26:12,860 INFO L82 PathProgramCache]: Analyzing trace with hash -2027894353, now seen corresponding path program 1 times [2018-11-23 15:26:12,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:26:12,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:26:12,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:26:12,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:26:12,862 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:26:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:26:14,898 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse1 (* 2 .cse4))) (let ((.cse2 (* (- 2) .cse4)) (.cse0 (= .cse1 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or .cse0 (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2 (- 2)) 4294967296)) 2) c_main_~y~0)) (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2) 4294967296))) c_main_~y~0)) (and (not .cse0) (< c_main_~y~0 .cse3))))))) is different from false [2018-11-23 15:26:14,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:26:14,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:26:14,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:26:14,901 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:26:14,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:26:14,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:26:14,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-23 15:26:14,902 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand 3 states. [2018-11-23 15:26:14,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:26:14,905 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2018-11-23 15:26:14,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:26:14,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 15:26:14,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:26:14,906 INFO L225 Difference]: With dead ends: 60 [2018-11-23 15:26:14,906 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 15:26:14,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-23 15:26:14,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 15:26:14,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-23 15:26:14,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 15:26:14,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2018-11-23 15:26:14,910 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 21 [2018-11-23 15:26:14,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:26:14,911 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2018-11-23 15:26:14,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:26:14,911 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-11-23 15:26:14,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 15:26:14,911 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:26:14,912 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] [2018-11-23 15:26:14,912 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:26:14,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:26:14,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1680266929, now seen corresponding path program 1 times [2018-11-23 15:26:14,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:26:14,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:26:14,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:26:14,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:26:14,913 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:26:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:26:16,942 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse1 (* 2 .cse4))) (let ((.cse2 (* (- 2) .cse4)) (.cse0 (= .cse1 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or .cse0 (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2 (- 2)) 4294967296)) 2) c_main_~y~0)) (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2) 4294967296))) c_main_~y~0)) (and (not .cse0) (< c_main_~y~0 .cse3))))))) is different from false [2018-11-23 15:26:16,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:26:16,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:26:16,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:26:16,945 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:26:16,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:26:16,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:26:16,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-23 15:26:16,946 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand 3 states. [2018-11-23 15:26:16,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:26:16,948 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-11-23 15:26:16,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:26:16,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 15:26:16,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:26:16,949 INFO L225 Difference]: With dead ends: 60 [2018-11-23 15:26:16,949 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 15:26:16,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-23 15:26:16,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 15:26:16,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-23 15:26:16,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 15:26:16,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-11-23 15:26:16,952 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 21 [2018-11-23 15:26:16,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:26:16,952 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-11-23 15:26:16,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:26:16,952 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-23 15:26:16,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 15:26:16,953 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:26:16,953 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] [2018-11-23 15:26:16,953 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:26:16,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:26:16,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1938432367, now seen corresponding path program 1 times [2018-11-23 15:26:16,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:26:16,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:26:16,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:26:16,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:26:16,955 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:26:16,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:26:16,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:26:16,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:26:17,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:26:17,000 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:26:17,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:26:17,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:26:17,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:26:17,001 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 3 states. [2018-11-23 15:26:17,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:26:17,063 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2018-11-23 15:26:17,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:26:17,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 15:26:17,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:26:17,066 INFO L225 Difference]: With dead ends: 61 [2018-11-23 15:26:17,066 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 15:26:17,066 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-11-23 15:26:17,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 15:26:17,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-23 15:26:17,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 15:26:17,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-11-23 15:26:17,070 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 21 [2018-11-23 15:26:17,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:26:17,070 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-11-23 15:26:17,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:26:17,070 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-23 15:26:17,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 15:26:17,070 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:26:17,070 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] [2018-11-23 15:26:17,071 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:26:17,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:26:17,071 INFO L82 PathProgramCache]: Analyzing trace with hash -345519953, now seen corresponding path program 1 times [2018-11-23 15:26:17,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:26:17,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:26:17,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:26:17,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:26:17,072 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:26:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:26:17,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:26:17,109 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #91#return; [?] CALL call #t~ret2 := main(); [?] ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; VAL [main_~x~0=0, main_~y~0=3] [?] assume !!(~x~0 % 4294967296 < 99); VAL [main_~x~0=0, main_~y~0=3] [?] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; VAL [main_~x~0=2, main_~y~0=3] [?] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 2; VAL [main_~x~0=0, main_~y~0=3] [?] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; VAL [main_~x~0=2, main_~y~0=3] [?] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 2; VAL [main_~x~0=0, main_~y~0=3] [?] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; VAL [main_~x~0=2, main_~y~0=3] [?] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; VAL [main_~x~0=(- 2), main_~y~0=3] [?] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 4 + ~x~0; VAL [main_~x~0=2, main_~y~0=3] [?] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; VAL [main_~x~0=4, main_~y~0=3] [?] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; VAL [main_~x~0=0, main_~y~0=3] [?] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; VAL [main_~x~0=(- 4), main_~y~0=3] [?] assume !(~x~0 % 4294967296 < 99); VAL [main_~x~0=(- 4), main_~y~0=3] [?] CALL call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~x~0 := 0; [L11] ~y~0 := #t~nondet0; [L11] havoc #t~nondet0; VAL [~x~0=0, ~y~0=3] [L12-L33] assume !!(~x~0 % 4294967296 < 99); VAL [~x~0=0, ~y~0=3] [L13-L14] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L14] ~x~0 := 2 + ~x~0; VAL [~x~0=2, ~y~0=3] [L15-L16] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L16] ~x~0 := ~x~0 - 2; VAL [~x~0=0, ~y~0=3] [L17-L18] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L18] ~x~0 := 2 + ~x~0; VAL [~x~0=2, ~y~0=3] [L19-L20] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L20] ~x~0 := ~x~0 - 2; VAL [~x~0=0, ~y~0=3] [L21-L22] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L22] ~x~0 := 2 + ~x~0; VAL [~x~0=2, ~y~0=3] [L23-L24] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L24] ~x~0 := ~x~0 - 4; VAL [~x~0=-2, ~y~0=3] [L25-L26] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L26] ~x~0 := 4 + ~x~0; VAL [~x~0=2, ~y~0=3] [L27-L28] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L28] ~x~0 := 2 + ~x~0; VAL [~x~0=4, ~y~0=3] [L29-L30] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L30] ~x~0 := ~x~0 - 4; VAL [~x~0=0, ~y~0=3] [L31-L32] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L32] ~x~0 := ~x~0 - 4; VAL [~x~0=-4, ~y~0=3] [L12-L33] assume !(~x~0 % 4294967296 < 99); VAL [~x~0=-4, ~y~0=3] [L34] CALL call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~x~0 := 0; [L11] ~y~0 := #t~nondet0; [L11] havoc #t~nondet0; VAL [~x~0=0, ~y~0=3] [L12-L33] assume !!(~x~0 % 4294967296 < 99); VAL [~x~0=0, ~y~0=3] [L13-L14] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L14] ~x~0 := 2 + ~x~0; VAL [~x~0=2, ~y~0=3] [L15-L16] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L16] ~x~0 := ~x~0 - 2; VAL [~x~0=0, ~y~0=3] [L17-L18] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L18] ~x~0 := 2 + ~x~0; VAL [~x~0=2, ~y~0=3] [L19-L20] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L20] ~x~0 := ~x~0 - 2; VAL [~x~0=0, ~y~0=3] [L21-L22] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L22] ~x~0 := 2 + ~x~0; VAL [~x~0=2, ~y~0=3] [L23-L24] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L24] ~x~0 := ~x~0 - 4; VAL [~x~0=-2, ~y~0=3] [L25-L26] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L26] ~x~0 := 4 + ~x~0; VAL [~x~0=2, ~y~0=3] [L27-L28] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L28] ~x~0 := 2 + ~x~0; VAL [~x~0=4, ~y~0=3] [L29-L30] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L30] ~x~0 := ~x~0 - 4; VAL [~x~0=0, ~y~0=3] [L31-L32] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L32] ~x~0 := ~x~0 - 4; VAL [~x~0=-4, ~y~0=3] [L12-L33] assume !(~x~0 % 4294967296 < 99); VAL [~x~0=-4, ~y~0=3] [L34] CALL call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~x~0 := 0; [L11] ~y~0 := #t~nondet0; [L11] havoc #t~nondet0; VAL [~x~0=0, ~y~0=3] [L12-L33] COND FALSE !(!(~x~0 % 4294967296 < 99)) VAL [~x~0=0, ~y~0=3] [L13] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L14] ~x~0 := 2 + ~x~0; VAL [~x~0=2, ~y~0=3] [L15] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L16] ~x~0 := ~x~0 - 2; VAL [~x~0=0, ~y~0=3] [L17] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L18] ~x~0 := 2 + ~x~0; VAL [~x~0=2, ~y~0=3] [L19] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L20] ~x~0 := ~x~0 - 2; VAL [~x~0=0, ~y~0=3] [L21] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L22] ~x~0 := 2 + ~x~0; VAL [~x~0=2, ~y~0=3] [L23] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L24] ~x~0 := ~x~0 - 4; VAL [~x~0=-2, ~y~0=3] [L25] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L26] ~x~0 := 4 + ~x~0; VAL [~x~0=2, ~y~0=3] [L27] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L28] ~x~0 := 2 + ~x~0; VAL [~x~0=4, ~y~0=3] [L29] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L30] ~x~0 := ~x~0 - 4; VAL [~x~0=0, ~y~0=3] [L31] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L32] ~x~0 := ~x~0 - 4; VAL [~x~0=-4, ~y~0=3] [L12-L33] COND TRUE !(~x~0 % 4294967296 < 99) VAL [~x~0=-4, ~y~0=3] [L34] CALL call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~x~0 := 0; [L11] ~y~0 := #t~nondet0; [L11] havoc #t~nondet0; VAL [~x~0=0, ~y~0=3] [L12-L33] COND FALSE !(!(~x~0 % 4294967296 < 99)) VAL [~x~0=0, ~y~0=3] [L13] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L14] ~x~0 := 2 + ~x~0; VAL [~x~0=2, ~y~0=3] [L15] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L16] ~x~0 := ~x~0 - 2; VAL [~x~0=0, ~y~0=3] [L17] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L18] ~x~0 := 2 + ~x~0; VAL [~x~0=2, ~y~0=3] [L19] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L20] ~x~0 := ~x~0 - 2; VAL [~x~0=0, ~y~0=3] [L21] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L22] ~x~0 := 2 + ~x~0; VAL [~x~0=2, ~y~0=3] [L23] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L24] ~x~0 := ~x~0 - 4; VAL [~x~0=-2, ~y~0=3] [L25] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L26] ~x~0 := 4 + ~x~0; VAL [~x~0=2, ~y~0=3] [L27] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L28] ~x~0 := 2 + ~x~0; VAL [~x~0=4, ~y~0=3] [L29] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L30] ~x~0 := ~x~0 - 4; VAL [~x~0=0, ~y~0=3] [L31] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L32] ~x~0 := ~x~0 - 4; VAL [~x~0=-4, ~y~0=3] [L12-L33] COND TRUE !(~x~0 % 4294967296 < 99) VAL [~x~0=-4, ~y~0=3] [L34] CALL call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~x~0 := 0; [L11] ~y~0 := #t~nondet0; [L11] havoc #t~nondet0; VAL [~x~0=0, ~y~0=3] [L12-L33] COND FALSE !(!(~x~0 % 4294967296 < 99)) VAL [~x~0=0, ~y~0=3] [L13] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L14] ~x~0 := 2 + ~x~0; VAL [~x~0=2, ~y~0=3] [L15] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L16] ~x~0 := ~x~0 - 2; VAL [~x~0=0, ~y~0=3] [L17] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L18] ~x~0 := 2 + ~x~0; VAL [~x~0=2, ~y~0=3] [L19] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L20] ~x~0 := ~x~0 - 2; VAL [~x~0=0, ~y~0=3] [L21] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L22] ~x~0 := 2 + ~x~0; VAL [~x~0=2, ~y~0=3] [L23] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L24] ~x~0 := ~x~0 - 4; VAL [~x~0=-2, ~y~0=3] [L25] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L26] ~x~0 := 4 + ~x~0; VAL [~x~0=2, ~y~0=3] [L27] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L28] ~x~0 := 2 + ~x~0; VAL [~x~0=4, ~y~0=3] [L29] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L30] ~x~0 := ~x~0 - 4; VAL [~x~0=0, ~y~0=3] [L31] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L32] ~x~0 := ~x~0 - 4; VAL [~x~0=-4, ~y~0=3] [L12-L33] COND TRUE !(~x~0 % 4294967296 < 99) VAL [~x~0=-4, ~y~0=3] [L34] CALL call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~x~0 := 0; [L11] ~y~0 := #t~nondet0; [L11] havoc #t~nondet0; VAL [~x~0=0, ~y~0=3] [L12-L33] COND FALSE !(!(~x~0 % 4294967296 < 99)) VAL [~x~0=0, ~y~0=3] [L13] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L14] ~x~0 := 2 + ~x~0; VAL [~x~0=2, ~y~0=3] [L15] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L16] ~x~0 := ~x~0 - 2; VAL [~x~0=0, ~y~0=3] [L17] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L18] ~x~0 := 2 + ~x~0; VAL [~x~0=2, ~y~0=3] [L19] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L20] ~x~0 := ~x~0 - 2; VAL [~x~0=0, ~y~0=3] [L21] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L22] ~x~0 := 2 + ~x~0; VAL [~x~0=2, ~y~0=3] [L23] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L24] ~x~0 := ~x~0 - 4; VAL [~x~0=-2, ~y~0=3] [L25] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L26] ~x~0 := 4 + ~x~0; VAL [~x~0=2, ~y~0=3] [L27] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L28] ~x~0 := 2 + ~x~0; VAL [~x~0=4, ~y~0=3] [L29] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L30] ~x~0 := ~x~0 - 4; VAL [~x~0=0, ~y~0=3] [L31] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L32] ~x~0 := ~x~0 - 4; VAL [~x~0=-4, ~y~0=3] [L12-L33] COND TRUE !(~x~0 % 4294967296 < 99) VAL [~x~0=-4, ~y~0=3] [L34] CALL call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [L10] unsigned int x = 0; [L11] unsigned int y = __VERIFIER_nondet_uint(); [L12] COND TRUE x < 99 VAL [x=0, y=3] [L13] COND FALSE !(y % 2 == 0) [L14] x += 2 VAL [x=2, y=3] [L15] COND FALSE !(y % 2 == 0) [L16] x -= 2 VAL [x=0, y=3] [L17] COND FALSE !(y % 2 == 0) [L18] x += 2 VAL [x=2, y=3] [L19] COND FALSE !(y % 2 == 0) [L20] x -= 2 VAL [x=0, y=3] [L21] COND FALSE !(y % 2 == 0) [L22] x += 2 VAL [x=2, y=3] [L23] COND FALSE !(y % 2 == 0) [L24] x -= 4 VAL [x=4294967294, y=3] [L25] COND FALSE !(y % 2 == 0) [L26] x += 4 VAL [x=2, y=3] [L27] COND FALSE !(y % 2 == 0) [L28] x += 2 VAL [x=4, y=3] [L29] COND FALSE !(y % 2 == 0) [L30] x -= 4 VAL [x=0, y=3] [L31] COND FALSE !(y % 2 == 0) [L32] x -= 4 VAL [x=4294967292, y=3] [L12] COND FALSE !(x < 99) VAL [x=4294967292, y=3] [L34] CALL __VERIFIER_assert((x % 2) == (y % 2)) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 15:26:17,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:26:17 BoogieIcfgContainer [2018-11-23 15:26:17,135 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 15:26:17,136 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:26:17,136 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:26:17,136 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:26:17,136 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:26:08" (3/4) ... [2018-11-23 15:26:17,138 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #91#return; [?] CALL call #t~ret2 := main(); [?] ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; VAL [main_~x~0=0, main_~y~0=3] [?] assume !!(~x~0 % 4294967296 < 99); VAL [main_~x~0=0, main_~y~0=3] [?] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; VAL [main_~x~0=2, main_~y~0=3] [?] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 2; VAL [main_~x~0=0, main_~y~0=3] [?] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; VAL [main_~x~0=2, main_~y~0=3] [?] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 2; VAL [main_~x~0=0, main_~y~0=3] [?] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; VAL [main_~x~0=2, main_~y~0=3] [?] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; VAL [main_~x~0=(- 2), main_~y~0=3] [?] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 4 + ~x~0; VAL [main_~x~0=2, main_~y~0=3] [?] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; VAL [main_~x~0=4, main_~y~0=3] [?] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; VAL [main_~x~0=0, main_~y~0=3] [?] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; VAL [main_~x~0=(- 4), main_~y~0=3] [?] assume !(~x~0 % 4294967296 < 99); VAL [main_~x~0=(- 4), main_~y~0=3] [?] CALL call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~x~0 := 0; [L11] ~y~0 := #t~nondet0; [L11] havoc #t~nondet0; VAL [~x~0=0, ~y~0=3] [L12-L33] assume !!(~x~0 % 4294967296 < 99); VAL [~x~0=0, ~y~0=3] [L13-L14] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L14] ~x~0 := 2 + ~x~0; VAL [~x~0=2, ~y~0=3] [L15-L16] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L16] ~x~0 := ~x~0 - 2; VAL [~x~0=0, ~y~0=3] [L17-L18] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L18] ~x~0 := 2 + ~x~0; VAL [~x~0=2, ~y~0=3] [L19-L20] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L20] ~x~0 := ~x~0 - 2; VAL [~x~0=0, ~y~0=3] [L21-L22] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L22] ~x~0 := 2 + ~x~0; VAL [~x~0=2, ~y~0=3] [L23-L24] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L24] ~x~0 := ~x~0 - 4; VAL [~x~0=-2, ~y~0=3] [L25-L26] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L26] ~x~0 := 4 + ~x~0; VAL [~x~0=2, ~y~0=3] [L27-L28] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L28] ~x~0 := 2 + ~x~0; VAL [~x~0=4, ~y~0=3] [L29-L30] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L30] ~x~0 := ~x~0 - 4; VAL [~x~0=0, ~y~0=3] [L31-L32] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L32] ~x~0 := ~x~0 - 4; VAL [~x~0=-4, ~y~0=3] [L12-L33] assume !(~x~0 % 4294967296 < 99); VAL [~x~0=-4, ~y~0=3] [L34] CALL call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~x~0 := 0; [L11] ~y~0 := #t~nondet0; [L11] havoc #t~nondet0; VAL [~x~0=0, ~y~0=3] [L12-L33] assume !!(~x~0 % 4294967296 < 99); VAL [~x~0=0, ~y~0=3] [L13-L14] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L14] ~x~0 := 2 + ~x~0; VAL [~x~0=2, ~y~0=3] [L15-L16] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L16] ~x~0 := ~x~0 - 2; VAL [~x~0=0, ~y~0=3] [L17-L18] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L18] ~x~0 := 2 + ~x~0; VAL [~x~0=2, ~y~0=3] [L19-L20] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L20] ~x~0 := ~x~0 - 2; VAL [~x~0=0, ~y~0=3] [L21-L22] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L22] ~x~0 := 2 + ~x~0; VAL [~x~0=2, ~y~0=3] [L23-L24] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L24] ~x~0 := ~x~0 - 4; VAL [~x~0=-2, ~y~0=3] [L25-L26] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L26] ~x~0 := 4 + ~x~0; VAL [~x~0=2, ~y~0=3] [L27-L28] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L28] ~x~0 := 2 + ~x~0; VAL [~x~0=4, ~y~0=3] [L29-L30] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L30] ~x~0 := ~x~0 - 4; VAL [~x~0=0, ~y~0=3] [L31-L32] assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296); [L32] ~x~0 := ~x~0 - 4; VAL [~x~0=-4, ~y~0=3] [L12-L33] assume !(~x~0 % 4294967296 < 99); VAL [~x~0=-4, ~y~0=3] [L34] CALL call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~x~0 := 0; [L11] ~y~0 := #t~nondet0; [L11] havoc #t~nondet0; VAL [~x~0=0, ~y~0=3] [L12-L33] COND FALSE !(!(~x~0 % 4294967296 < 99)) VAL [~x~0=0, ~y~0=3] [L13] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L14] ~x~0 := 2 + ~x~0; VAL [~x~0=2, ~y~0=3] [L15] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L16] ~x~0 := ~x~0 - 2; VAL [~x~0=0, ~y~0=3] [L17] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L18] ~x~0 := 2 + ~x~0; VAL [~x~0=2, ~y~0=3] [L19] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L20] ~x~0 := ~x~0 - 2; VAL [~x~0=0, ~y~0=3] [L21] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L22] ~x~0 := 2 + ~x~0; VAL [~x~0=2, ~y~0=3] [L23] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L24] ~x~0 := ~x~0 - 4; VAL [~x~0=-2, ~y~0=3] [L25] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L26] ~x~0 := 4 + ~x~0; VAL [~x~0=2, ~y~0=3] [L27] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L28] ~x~0 := 2 + ~x~0; VAL [~x~0=4, ~y~0=3] [L29] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L30] ~x~0 := ~x~0 - 4; VAL [~x~0=0, ~y~0=3] [L31] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L32] ~x~0 := ~x~0 - 4; VAL [~x~0=-4, ~y~0=3] [L12-L33] COND TRUE !(~x~0 % 4294967296 < 99) VAL [~x~0=-4, ~y~0=3] [L34] CALL call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~x~0 := 0; [L11] ~y~0 := #t~nondet0; [L11] havoc #t~nondet0; VAL [~x~0=0, ~y~0=3] [L12-L33] COND FALSE !(!(~x~0 % 4294967296 < 99)) VAL [~x~0=0, ~y~0=3] [L13] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L14] ~x~0 := 2 + ~x~0; VAL [~x~0=2, ~y~0=3] [L15] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L16] ~x~0 := ~x~0 - 2; VAL [~x~0=0, ~y~0=3] [L17] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L18] ~x~0 := 2 + ~x~0; VAL [~x~0=2, ~y~0=3] [L19] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L20] ~x~0 := ~x~0 - 2; VAL [~x~0=0, ~y~0=3] [L21] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L22] ~x~0 := 2 + ~x~0; VAL [~x~0=2, ~y~0=3] [L23] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L24] ~x~0 := ~x~0 - 4; VAL [~x~0=-2, ~y~0=3] [L25] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L26] ~x~0 := 4 + ~x~0; VAL [~x~0=2, ~y~0=3] [L27] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L28] ~x~0 := 2 + ~x~0; VAL [~x~0=4, ~y~0=3] [L29] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L30] ~x~0 := ~x~0 - 4; VAL [~x~0=0, ~y~0=3] [L31] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L32] ~x~0 := ~x~0 - 4; VAL [~x~0=-4, ~y~0=3] [L12-L33] COND TRUE !(~x~0 % 4294967296 < 99) VAL [~x~0=-4, ~y~0=3] [L34] CALL call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~x~0 := 0; [L11] ~y~0 := #t~nondet0; [L11] havoc #t~nondet0; VAL [~x~0=0, ~y~0=3] [L12-L33] COND FALSE !(!(~x~0 % 4294967296 < 99)) VAL [~x~0=0, ~y~0=3] [L13] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L14] ~x~0 := 2 + ~x~0; VAL [~x~0=2, ~y~0=3] [L15] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L16] ~x~0 := ~x~0 - 2; VAL [~x~0=0, ~y~0=3] [L17] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L18] ~x~0 := 2 + ~x~0; VAL [~x~0=2, ~y~0=3] [L19] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L20] ~x~0 := ~x~0 - 2; VAL [~x~0=0, ~y~0=3] [L21] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L22] ~x~0 := 2 + ~x~0; VAL [~x~0=2, ~y~0=3] [L23] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L24] ~x~0 := ~x~0 - 4; VAL [~x~0=-2, ~y~0=3] [L25] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L26] ~x~0 := 4 + ~x~0; VAL [~x~0=2, ~y~0=3] [L27] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L28] ~x~0 := 2 + ~x~0; VAL [~x~0=4, ~y~0=3] [L29] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L30] ~x~0 := ~x~0 - 4; VAL [~x~0=0, ~y~0=3] [L31] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L32] ~x~0 := ~x~0 - 4; VAL [~x~0=-4, ~y~0=3] [L12-L33] COND TRUE !(~x~0 % 4294967296 < 99) VAL [~x~0=-4, ~y~0=3] [L34] CALL call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~x~0 := 0; [L11] ~y~0 := #t~nondet0; [L11] havoc #t~nondet0; VAL [~x~0=0, ~y~0=3] [L12-L33] COND FALSE !(!(~x~0 % 4294967296 < 99)) VAL [~x~0=0, ~y~0=3] [L13] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L14] ~x~0 := 2 + ~x~0; VAL [~x~0=2, ~y~0=3] [L15] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L16] ~x~0 := ~x~0 - 2; VAL [~x~0=0, ~y~0=3] [L17] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L18] ~x~0 := 2 + ~x~0; VAL [~x~0=2, ~y~0=3] [L19] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L20] ~x~0 := ~x~0 - 2; VAL [~x~0=0, ~y~0=3] [L21] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L22] ~x~0 := 2 + ~x~0; VAL [~x~0=2, ~y~0=3] [L23] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L24] ~x~0 := ~x~0 - 4; VAL [~x~0=-2, ~y~0=3] [L25] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L26] ~x~0 := 4 + ~x~0; VAL [~x~0=2, ~y~0=3] [L27] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L28] ~x~0 := 2 + ~x~0; VAL [~x~0=4, ~y~0=3] [L29] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L30] ~x~0 := ~x~0 - 4; VAL [~x~0=0, ~y~0=3] [L31] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L32] ~x~0 := ~x~0 - 4; VAL [~x~0=-4, ~y~0=3] [L12-L33] COND TRUE !(~x~0 % 4294967296 < 99) VAL [~x~0=-4, ~y~0=3] [L34] CALL call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [L10] unsigned int x = 0; [L11] unsigned int y = __VERIFIER_nondet_uint(); [L12] COND TRUE x < 99 VAL [x=0, y=3] [L13] COND FALSE !(y % 2 == 0) [L14] x += 2 VAL [x=2, y=3] [L15] COND FALSE !(y % 2 == 0) [L16] x -= 2 VAL [x=0, y=3] [L17] COND FALSE !(y % 2 == 0) [L18] x += 2 VAL [x=2, y=3] [L19] COND FALSE !(y % 2 == 0) [L20] x -= 2 VAL [x=0, y=3] [L21] COND FALSE !(y % 2 == 0) [L22] x += 2 VAL [x=2, y=3] [L23] COND FALSE !(y % 2 == 0) [L24] x -= 4 VAL [x=4294967294, y=3] [L25] COND FALSE !(y % 2 == 0) [L26] x += 4 VAL [x=2, y=3] [L27] COND FALSE !(y % 2 == 0) [L28] x += 2 VAL [x=4, y=3] [L29] COND FALSE !(y % 2 == 0) [L30] x -= 4 VAL [x=0, y=3] [L31] COND FALSE !(y % 2 == 0) [L32] x -= 4 VAL [x=4294967292, y=3] [L12] COND FALSE !(x < 99) VAL [x=4294967292, y=3] [L34] CALL __VERIFIER_assert((x % 2) == (y % 2)) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 15:26:17,179 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_27288ea6-d02f-4568-86d1-24362eb04c02/bin-2019/utaipan/witness.graphml [2018-11-23 15:26:17,179 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:26:17,180 INFO L168 Benchmark]: Toolchain (without parser) took 9530.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 961.1 MB in the beginning and 849.0 MB in the end (delta: 112.1 MB). Peak memory consumption was 238.5 MB. Max. memory is 11.5 GB. [2018-11-23 15:26:17,181 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:26:17,181 INFO L168 Benchmark]: CACSL2BoogieTranslator took 218.29 ms. Allocated memory is still 1.0 GB. Free memory was 961.1 MB in the beginning and 950.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:26:17,182 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.43 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 945.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 15:26:17,182 INFO L168 Benchmark]: Boogie Preprocessor took 23.00 ms. Allocated memory is still 1.0 GB. Free memory is still 945.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:26:17,182 INFO L168 Benchmark]: RCFGBuilder took 295.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 945.0 MB in the beginning and 1.1 GB in the end (delta: -161.7 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 15:26:17,183 INFO L168 Benchmark]: TraceAbstraction took 8928.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 855.7 MB in the end (delta: 251.0 MB). Peak memory consumption was 251.0 MB. Max. memory is 11.5 GB. [2018-11-23 15:26:17,183 INFO L168 Benchmark]: Witness Printer took 43.91 ms. Allocated memory is still 1.2 GB. Free memory was 855.7 MB in the beginning and 849.0 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:26:17,185 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 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 218.29 ms. Allocated memory is still 1.0 GB. Free memory was 961.1 MB in the beginning and 950.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.43 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 945.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.00 ms. Allocated memory is still 1.0 GB. Free memory is still 945.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 295.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 945.0 MB in the beginning and 1.1 GB in the end (delta: -161.7 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8928.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 855.7 MB in the end (delta: 251.0 MB). Peak memory consumption was 251.0 MB. Max. memory is 11.5 GB. * Witness Printer took 43.91 ms. Allocated memory is still 1.2 GB. Free memory was 855.7 MB in the beginning and 849.0 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] unsigned int x = 0; [L11] unsigned int y = __VERIFIER_nondet_uint(); [L12] COND TRUE x < 99 VAL [x=0, y=3] [L13] COND FALSE !(y % 2 == 0) [L14] x += 2 VAL [x=2, y=3] [L15] COND FALSE !(y % 2 == 0) [L16] x -= 2 VAL [x=0, y=3] [L17] COND FALSE !(y % 2 == 0) [L18] x += 2 VAL [x=2, y=3] [L19] COND FALSE !(y % 2 == 0) [L20] x -= 2 VAL [x=0, y=3] [L21] COND FALSE !(y % 2 == 0) [L22] x += 2 VAL [x=2, y=3] [L23] COND FALSE !(y % 2 == 0) [L24] x -= 4 VAL [x=4294967294, y=3] [L25] COND FALSE !(y % 2 == 0) [L26] x += 4 VAL [x=2, y=3] [L27] COND FALSE !(y % 2 == 0) [L28] x += 2 VAL [x=4, y=3] [L29] COND FALSE !(y % 2 == 0) [L30] x -= 4 VAL [x=0, y=3] [L31] COND FALSE !(y % 2 == 0) [L32] x -= 4 VAL [x=4294967292, y=3] [L12] COND FALSE !(x < 99) VAL [x=4294967292, y=3] [L34] CALL __VERIFIER_assert((x % 2) == (y % 2)) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. UNSAFE Result, 8.8s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 216 SDtfs, 20 SDslu, 146 SDs, 0 SdLazy, 363 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 5 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 188 NumberOfCodeBlocks, 188 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 19216 SizeOfPredicates, 1 NumberOfNonLiveVariables, 65 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 5/8 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...