./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/num_conversion_1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/num_conversion_1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 22f8891fc10bb8c305de18eb9540699e7b8a01ce ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/num_conversion_1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 22f8891fc10bb8c305de18eb9540699e7b8a01ce .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-25 19:35:06,619 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 19:35:06,624 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 19:35:06,691 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 19:35:06,692 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 19:35:06,700 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 19:35:06,703 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 19:35:06,711 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 19:35:06,720 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 19:35:06,724 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 19:35:06,727 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 19:35:06,729 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 19:35:06,729 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 19:35:06,738 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 19:35:06,741 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 19:35:06,743 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 19:35:06,744 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 19:35:06,749 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 19:35:06,752 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 19:35:06,759 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 19:35:06,765 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 19:35:06,767 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 19:35:06,769 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 19:35:06,772 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 19:35:06,780 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 19:35:06,780 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 19:35:06,781 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 19:35:06,782 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 19:35:06,784 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 19:35:06,785 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 19:35:06,786 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 19:35:06,787 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 19:35:06,789 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 19:35:06,791 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 19:35:06,792 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 19:35:06,793 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 19:35:06,797 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 19:35:06,797 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 19:35:06,798 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 19:35:06,800 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 19:35:06,802 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 19:35:06,803 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-25 19:35:06,866 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 19:35:06,867 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 19:35:06,870 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 19:35:06,871 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 19:35:06,872 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 19:35:06,872 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 19:35:06,872 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 19:35:06,873 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-25 19:35:06,873 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 19:35:06,874 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 19:35:06,875 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 19:35:06,875 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 19:35:06,876 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 19:35:06,876 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 19:35:06,876 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 19:35:06,876 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 19:35:06,877 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 19:35:06,877 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 19:35:06,877 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 19:35:06,878 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 19:35:06,878 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 19:35:06,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 19:35:06,879 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 19:35:06,879 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 19:35:06,880 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 19:35:06,880 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-25 19:35:06,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-25 19:35:06,880 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 19:35:06,881 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 19:35:06,881 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 22f8891fc10bb8c305de18eb9540699e7b8a01ce [2020-10-25 19:35:07,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 19:35:07,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 19:35:07,394 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 19:35:07,396 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 19:35:07,398 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 19:35:07,399 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/num_conversion_1.c [2020-10-25 19:35:07,479 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1774c5fed/0bbfbf75a94f47c28703379081b32537/FLAGe202aedce [2020-10-25 19:35:08,112 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 19:35:08,113 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_1.c [2020-10-25 19:35:08,121 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1774c5fed/0bbfbf75a94f47c28703379081b32537/FLAGe202aedce [2020-10-25 19:35:08,488 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1774c5fed/0bbfbf75a94f47c28703379081b32537 [2020-10-25 19:35:08,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 19:35:08,503 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 19:35:08,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 19:35:08,507 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 19:35:08,512 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 19:35:08,513 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 07:35:08" (1/1) ... [2020-10-25 19:35:08,518 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57e85beb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:08, skipping insertion in model container [2020-10-25 19:35:08,519 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 07:35:08" (1/1) ... [2020-10-25 19:35:08,529 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 19:35:08,550 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 19:35:08,850 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 19:35:08,862 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 19:35:08,883 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 19:35:08,901 INFO L208 MainTranslator]: Completed translation [2020-10-25 19:35:08,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:08 WrapperNode [2020-10-25 19:35:08,902 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 19:35:08,904 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 19:35:08,904 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 19:35:08,904 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 19:35:08,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:08" (1/1) ... [2020-10-25 19:35:08,924 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:08" (1/1) ... [2020-10-25 19:35:08,945 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 19:35:08,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 19:35:08,947 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 19:35:08,947 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 19:35:08,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:08" (1/1) ... [2020-10-25 19:35:08,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:08" (1/1) ... [2020-10-25 19:35:08,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:08" (1/1) ... [2020-10-25 19:35:08,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:08" (1/1) ... [2020-10-25 19:35:08,965 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:08" (1/1) ... [2020-10-25 19:35:08,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:08" (1/1) ... [2020-10-25 19:35:08,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:08" (1/1) ... [2020-10-25 19:35:08,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 19:35:08,975 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 19:35:08,976 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 19:35:08,976 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 19:35:08,977 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 19:35:09,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 19:35:09,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 19:35:09,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-25 19:35:09,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 19:35:09,313 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 19:35:09,313 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-10-25 19:35:09,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:35:09 BoogieIcfgContainer [2020-10-25 19:35:09,316 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 19:35:09,318 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 19:35:09,318 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 19:35:09,322 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 19:35:09,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 07:35:08" (1/3) ... [2020-10-25 19:35:09,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a3af20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 07:35:09, skipping insertion in model container [2020-10-25 19:35:09,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:08" (2/3) ... [2020-10-25 19:35:09,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a3af20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 07:35:09, skipping insertion in model container [2020-10-25 19:35:09,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:35:09" (3/3) ... [2020-10-25 19:35:09,328 INFO L111 eAbstractionObserver]: Analyzing ICFG num_conversion_1.c [2020-10-25 19:35:09,343 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 19:35:09,352 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-25 19:35:09,369 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-25 19:35:09,401 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 19:35:09,402 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 19:35:09,402 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 19:35:09,403 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 19:35:09,403 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 19:35:09,403 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 19:35:09,403 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 19:35:09,404 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 19:35:09,443 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2020-10-25 19:35:09,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-10-25 19:35:09,458 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:09,460 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-10-25 19:35:09,462 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:09,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:09,479 INFO L82 PathProgramCache]: Analyzing trace with hash 889968487, now seen corresponding path program 1 times [2020-10-25 19:35:09,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:35:09,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525556913] [2020-10-25 19:35:09,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:35:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:09,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:35:09,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525556913] [2020-10-25 19:35:09,748 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:35:09,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-25 19:35:09,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006224774] [2020-10-25 19:35:09,764 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-25 19:35:09,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:35:09,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-25 19:35:09,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-25 19:35:09,786 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2020-10-25 19:35:09,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:09,805 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2020-10-25 19:35:09,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-25 19:35:09,807 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2020-10-25 19:35:09,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:09,817 INFO L225 Difference]: With dead ends: 22 [2020-10-25 19:35:09,818 INFO L226 Difference]: Without dead ends: 9 [2020-10-25 19:35:09,822 INFO L677 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 [2020-10-25 19:35:09,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2020-10-25 19:35:09,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-10-25 19:35:09,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-25 19:35:09,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2020-10-25 19:35:09,862 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2020-10-25 19:35:09,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:09,863 INFO L481 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-10-25 19:35:09,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-25 19:35:09,863 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2020-10-25 19:35:09,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-10-25 19:35:09,864 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:09,864 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-10-25 19:35:09,865 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-25 19:35:09,865 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:09,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:09,867 INFO L82 PathProgramCache]: Analyzing trace with hash 889640786, now seen corresponding path program 1 times [2020-10-25 19:35:09,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:35:09,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966093403] [2020-10-25 19:35:09,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:35:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:09,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:35:09,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966093403] [2020-10-25 19:35:09,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:35:09,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:35:09,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705753419] [2020-10-25 19:35:09,946 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:35:09,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:35:09,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:35:09,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:35:09,948 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 3 states. [2020-10-25 19:35:09,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:09,981 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2020-10-25 19:35:09,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:35:09,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-10-25 19:35:09,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:09,983 INFO L225 Difference]: With dead ends: 16 [2020-10-25 19:35:09,983 INFO L226 Difference]: Without dead ends: 12 [2020-10-25 19:35:09,985 INFO L677 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 [2020-10-25 19:35:09,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-10-25 19:35:09,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2020-10-25 19:35:09,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-25 19:35:09,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2020-10-25 19:35:09,994 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2020-10-25 19:35:09,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:09,995 INFO L481 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2020-10-25 19:35:09,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:35:09,995 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2020-10-25 19:35:09,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-25 19:35:09,996 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:09,996 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:35:09,997 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-25 19:35:09,999 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:10,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:10,000 INFO L82 PathProgramCache]: Analyzing trace with hash 641725625, now seen corresponding path program 1 times [2020-10-25 19:35:10,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:35:10,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569982073] [2020-10-25 19:35:10,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:35:10,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:10,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:35:10,119 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569982073] [2020-10-25 19:35:10,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391098962] [2020-10-25 19:35:10,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 19:35:10,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:10,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-25 19:35:10,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:35:10,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:35:10,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 19:35:10,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-10-25 19:35:10,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634478339] [2020-10-25 19:35:10,257 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 19:35:10,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:35:10,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 19:35:10,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:35:10,262 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 5 states. [2020-10-25 19:35:10,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:10,313 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2020-10-25 19:35:10,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:35:10,315 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-25 19:35:10,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:10,316 INFO L225 Difference]: With dead ends: 19 [2020-10-25 19:35:10,316 INFO L226 Difference]: Without dead ends: 15 [2020-10-25 19:35:10,317 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:35:10,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-10-25 19:35:10,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2020-10-25 19:35:10,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-25 19:35:10,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2020-10-25 19:35:10,329 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 9 [2020-10-25 19:35:10,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:10,329 INFO L481 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2020-10-25 19:35:10,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 19:35:10,330 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2020-10-25 19:35:10,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-25 19:35:10,331 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:10,331 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-10-25 19:35:10,543 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-10-25 19:35:10,544 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:10,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:10,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1950053902, now seen corresponding path program 2 times [2020-10-25 19:35:10,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:35:10,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023133761] [2020-10-25 19:35:10,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:35:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:10,711 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:35:10,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023133761] [2020-10-25 19:35:10,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026405810] [2020-10-25 19:35:10,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 19:35:10,765 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-25 19:35:10,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 19:35:10,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-25 19:35:10,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:35:10,805 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:35:10,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 19:35:10,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-25 19:35:10,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892873156] [2020-10-25 19:35:10,807 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-25 19:35:10,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:35:10,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-25 19:35:10,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-25 19:35:10,809 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 7 states. [2020-10-25 19:35:10,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:10,891 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2020-10-25 19:35:10,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 19:35:10,893 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2020-10-25 19:35:10,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:10,894 INFO L225 Difference]: With dead ends: 22 [2020-10-25 19:35:10,895 INFO L226 Difference]: Without dead ends: 18 [2020-10-25 19:35:10,895 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-25 19:35:10,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-10-25 19:35:10,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2020-10-25 19:35:10,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-25 19:35:10,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2020-10-25 19:35:10,907 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 12 [2020-10-25 19:35:10,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:10,908 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-10-25 19:35:10,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-25 19:35:10,909 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2020-10-25 19:35:10,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-25 19:35:10,911 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:10,911 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2020-10-25 19:35:11,124 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 19:35:11,125 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:11,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:11,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1268104729, now seen corresponding path program 3 times [2020-10-25 19:35:11,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:35:11,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090006470] [2020-10-25 19:35:11,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:35:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:11,233 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:35:11,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090006470] [2020-10-25 19:35:11,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030838645] [2020-10-25 19:35:11,234 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 19:35:11,278 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-25 19:35:11,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 19:35:11,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-25 19:35:11,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:35:11,348 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:35:11,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 19:35:11,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-10-25 19:35:11,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30938569] [2020-10-25 19:35:11,352 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-25 19:35:11,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:35:11,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-25 19:35:11,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-25 19:35:11,353 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 9 states. [2020-10-25 19:35:11,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:11,473 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2020-10-25 19:35:11,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-25 19:35:11,474 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-10-25 19:35:11,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:11,475 INFO L225 Difference]: With dead ends: 25 [2020-10-25 19:35:11,475 INFO L226 Difference]: Without dead ends: 21 [2020-10-25 19:35:11,476 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-25 19:35:11,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-10-25 19:35:11,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2020-10-25 19:35:11,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-10-25 19:35:11,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2020-10-25 19:35:11,488 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 15 [2020-10-25 19:35:11,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:11,490 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2020-10-25 19:35:11,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-25 19:35:11,490 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2020-10-25 19:35:11,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-25 19:35:11,490 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:11,491 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2020-10-25 19:35:11,692 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 19:35:11,693 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:11,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:11,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1171899538, now seen corresponding path program 4 times [2020-10-25 19:35:11,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:35:11,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324685503] [2020-10-25 19:35:11,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:35:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:11,817 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:35:11,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324685503] [2020-10-25 19:35:11,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366935363] [2020-10-25 19:35:11,818 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 19:35:11,865 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-25 19:35:11,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 19:35:11,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-25 19:35:11,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:35:11,941 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:35:11,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 19:35:11,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2020-10-25 19:35:11,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618159889] [2020-10-25 19:35:11,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-25 19:35:11,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:35:11,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-25 19:35:11,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-25 19:35:11,948 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 11 states. [2020-10-25 19:35:12,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:12,055 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2020-10-25 19:35:12,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-25 19:35:12,057 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2020-10-25 19:35:12,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:12,058 INFO L225 Difference]: With dead ends: 28 [2020-10-25 19:35:12,058 INFO L226 Difference]: Without dead ends: 24 [2020-10-25 19:35:12,059 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-25 19:35:12,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-10-25 19:35:12,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2020-10-25 19:35:12,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-25 19:35:12,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2020-10-25 19:35:12,065 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 18 [2020-10-25 19:35:12,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:12,065 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-10-25 19:35:12,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-25 19:35:12,066 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2020-10-25 19:35:12,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-25 19:35:12,066 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:12,067 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1] [2020-10-25 19:35:12,277 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 19:35:12,278 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:12,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:12,279 INFO L82 PathProgramCache]: Analyzing trace with hash -133759111, now seen corresponding path program 5 times [2020-10-25 19:35:12,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:35:12,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913282844] [2020-10-25 19:35:12,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:35:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:12,451 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:35:12,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913282844] [2020-10-25 19:35:12,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331388506] [2020-10-25 19:35:12,452 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 19:35:12,505 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-10-25 19:35:12,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 19:35:12,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-25 19:35:12,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:35:12,577 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:35:12,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 19:35:12,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2020-10-25 19:35:12,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709655751] [2020-10-25 19:35:12,578 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-25 19:35:12,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:35:12,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-25 19:35:12,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-10-25 19:35:12,579 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand 13 states. [2020-10-25 19:35:12,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:12,695 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2020-10-25 19:35:12,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-25 19:35:12,695 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2020-10-25 19:35:12,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:12,696 INFO L225 Difference]: With dead ends: 31 [2020-10-25 19:35:12,696 INFO L226 Difference]: Without dead ends: 27 [2020-10-25 19:35:12,697 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-10-25 19:35:12,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-10-25 19:35:12,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2020-10-25 19:35:12,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-25 19:35:12,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2020-10-25 19:35:12,703 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 21 [2020-10-25 19:35:12,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:12,703 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2020-10-25 19:35:12,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-25 19:35:12,703 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2020-10-25 19:35:12,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-25 19:35:12,704 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:12,705 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1] [2020-10-25 19:35:12,915 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-10-25 19:35:12,916 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:12,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:12,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1786738894, now seen corresponding path program 6 times [2020-10-25 19:35:12,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:35:12,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513384831] [2020-10-25 19:35:12,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:35:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:13,070 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:35:13,070 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513384831] [2020-10-25 19:35:13,070 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127294426] [2020-10-25 19:35:13,071 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 19:35:13,135 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2020-10-25 19:35:13,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 19:35:13,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 15 conjunts are in the unsatisfiable core [2020-10-25 19:35:13,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:35:13,263 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:35:13,264 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 19:35:13,264 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2020-10-25 19:35:13,264 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241194545] [2020-10-25 19:35:13,265 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-25 19:35:13,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:35:13,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-25 19:35:13,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2020-10-25 19:35:13,267 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand 15 states. [2020-10-25 19:35:13,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:13,450 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2020-10-25 19:35:13,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-25 19:35:13,451 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2020-10-25 19:35:13,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:13,452 INFO L225 Difference]: With dead ends: 34 [2020-10-25 19:35:13,452 INFO L226 Difference]: Without dead ends: 30 [2020-10-25 19:35:13,453 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2020-10-25 19:35:13,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-10-25 19:35:13,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-10-25 19:35:13,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-10-25 19:35:13,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2020-10-25 19:35:13,460 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 24 [2020-10-25 19:35:13,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:13,461 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2020-10-25 19:35:13,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-25 19:35:13,461 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2020-10-25 19:35:13,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-25 19:35:13,462 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:13,462 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1] [2020-10-25 19:35:13,666 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 19:35:13,667 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:13,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:13,668 INFO L82 PathProgramCache]: Analyzing trace with hash 387561689, now seen corresponding path program 7 times [2020-10-25 19:35:13,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:35:13,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754966477] [2020-10-25 19:35:13,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:35:13,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:13,857 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:35:13,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754966477] [2020-10-25 19:35:13,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551998733] [2020-10-25 19:35:13,858 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 19:35:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:13,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 17 conjunts are in the unsatisfiable core [2020-10-25 19:35:13,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:35:14,077 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:35:14,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 19:35:14,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2020-10-25 19:35:14,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929143914] [2020-10-25 19:35:14,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-25 19:35:14,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:35:14,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-25 19:35:14,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2020-10-25 19:35:14,080 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 17 states. [2020-10-25 19:35:14,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:14,271 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2020-10-25 19:35:14,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-25 19:35:14,272 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-10-25 19:35:14,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:14,273 INFO L225 Difference]: With dead ends: 37 [2020-10-25 19:35:14,273 INFO L226 Difference]: Without dead ends: 33 [2020-10-25 19:35:14,273 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2020-10-25 19:35:14,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-10-25 19:35:14,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2020-10-25 19:35:14,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-25 19:35:14,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2020-10-25 19:35:14,279 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 27 [2020-10-25 19:35:14,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:14,280 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2020-10-25 19:35:14,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-25 19:35:14,280 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2020-10-25 19:35:14,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-25 19:35:14,281 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:14,281 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2020-10-25 19:35:14,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 19:35:14,493 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:14,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:14,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1720528430, now seen corresponding path program 8 times [2020-10-25 19:35:14,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:35:14,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797612872] [2020-10-25 19:35:14,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:35:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 19:35:14,522 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 19:35:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 19:35:14,561 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 19:35:14,611 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-25 19:35:14,611 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-25 19:35:14,612 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-25 19:35:14,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 07:35:14 BoogieIcfgContainer [2020-10-25 19:35:14,688 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 19:35:14,688 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 19:35:14,689 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 19:35:14,689 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 19:35:14,690 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:35:09" (3/4) ... [2020-10-25 19:35:14,694 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-25 19:35:14,694 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 19:35:14,697 INFO L168 Benchmark]: Toolchain (without parser) took 6197.97 ms. Allocated memory was 46.1 MB in the beginning and 83.9 MB in the end (delta: 37.7 MB). Free memory was 22.7 MB in the beginning and 30.3 MB in the end (delta: -7.6 MB). Peak memory consumption was 31.7 MB. Max. memory is 16.1 GB. [2020-10-25 19:35:14,698 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 46.1 MB. Free memory was 25.8 MB in the beginning and 25.8 MB in the end (delta: 28.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 19:35:14,699 INFO L168 Benchmark]: CACSL2BoogieTranslator took 396.26 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 22.0 MB in the beginning and 34.5 MB in the end (delta: -12.4 MB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. [2020-10-25 19:35:14,699 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.87 ms. Allocated memory is still 56.6 MB. Free memory was 34.5 MB in the beginning and 33.0 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 19:35:14,700 INFO L168 Benchmark]: Boogie Preprocessor took 27.87 ms. Allocated memory is still 56.6 MB. Free memory was 33.0 MB in the beginning and 32.0 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 19:35:14,701 INFO L168 Benchmark]: RCFGBuilder took 340.62 ms. Allocated memory is still 56.6 MB. Free memory was 32.0 MB in the beginning and 36.6 MB in the end (delta: -4.6 MB). Peak memory consumption was 14.0 MB. Max. memory is 16.1 GB. [2020-10-25 19:35:14,702 INFO L168 Benchmark]: TraceAbstraction took 5370.30 ms. Allocated memory was 56.6 MB in the beginning and 83.9 MB in the end (delta: 27.3 MB). Free memory was 36.2 MB in the beginning and 30.3 MB in the end (delta: 6.0 MB). Peak memory consumption was 33.3 MB. Max. memory is 16.1 GB. [2020-10-25 19:35:14,702 INFO L168 Benchmark]: Witness Printer took 5.50 ms. Allocated memory is still 83.9 MB. Free memory is still 30.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 19:35:14,713 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40 ms. Allocated memory is still 46.1 MB. Free memory was 25.8 MB in the beginning and 25.8 MB in the end (delta: 28.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 396.26 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 22.0 MB in the beginning and 34.5 MB in the end (delta: -12.4 MB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 41.87 ms. Allocated memory is still 56.6 MB. Free memory was 34.5 MB in the beginning and 33.0 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 27.87 ms. Allocated memory is still 56.6 MB. Free memory was 33.0 MB in the beginning and 32.0 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 340.62 ms. Allocated memory is still 56.6 MB. Free memory was 32.0 MB in the beginning and 36.6 MB in the end (delta: -4.6 MB). Peak memory consumption was 14.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 5370.30 ms. Allocated memory was 56.6 MB in the beginning and 83.9 MB in the end (delta: 27.3 MB). Free memory was 36.2 MB in the beginning and 30.3 MB in the end (delta: 6.0 MB). Peak memory consumption was 33.3 MB. Max. memory is 16.1 GB. * Witness Printer took 5.50 ms. Allocated memory is still 83.9 MB. Free memory is still 30.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of shiftLeft at line 24, overapproximation of bitwiseAnd at line 25. Possible FailurePath: [L16] unsigned char x; [L17] unsigned char y; [L18] unsigned char c; [L20] x = 37 [L21] y = 0 [L22] c = 0 [L23] COND TRUE c < (unsigned char)8 [L24] unsigned char i = ((unsigned char)1) << c; [L25] unsigned char bit = x & i; [L26] COND FALSE !(bit != (unsigned char)0) [L29] c = c + ((unsigned char)1) [L23] COND TRUE c < (unsigned char)8 [L24] unsigned char i = ((unsigned char)1) << c; [L25] unsigned char bit = x & i; [L26] COND FALSE !(bit != (unsigned char)0) [L29] c = c + ((unsigned char)1) [L23] COND TRUE c < (unsigned char)8 [L24] unsigned char i = ((unsigned char)1) << c; [L25] unsigned char bit = x & i; [L26] COND FALSE !(bit != (unsigned char)0) [L29] c = c + ((unsigned char)1) [L23] COND TRUE c < (unsigned char)8 [L24] unsigned char i = ((unsigned char)1) << c; [L25] unsigned char bit = x & i; [L26] COND FALSE !(bit != (unsigned char)0) [L29] c = c + ((unsigned char)1) [L23] COND TRUE c < (unsigned char)8 [L24] unsigned char i = ((unsigned char)1) << c; [L25] unsigned char bit = x & i; [L26] COND FALSE !(bit != (unsigned char)0) [L29] c = c + ((unsigned char)1) [L23] COND TRUE c < (unsigned char)8 [L24] unsigned char i = ((unsigned char)1) << c; [L25] unsigned char bit = x & i; [L26] COND FALSE !(bit != (unsigned char)0) [L29] c = c + ((unsigned char)1) [L23] COND TRUE c < (unsigned char)8 [L24] unsigned char i = ((unsigned char)1) << c; [L25] unsigned char bit = x & i; [L26] COND FALSE !(bit != (unsigned char)0) [L29] c = c + ((unsigned char)1) [L23] COND TRUE c < (unsigned char)8 [L24] unsigned char i = ((unsigned char)1) << c; [L25] unsigned char bit = x & i; [L26] COND FALSE !(bit != (unsigned char)0) [L29] c = c + ((unsigned char)1) [L23] COND FALSE !(c < (unsigned char)8) [L7] COND TRUE !(cond) [L3] __assert_fail("0", "num_conversion_1.c", 3, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.2s, OverallIterations: 10, TraceHistogramMax: 8, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 134 SDtfs, 142 SDslu, 636 SDs, 0 SdLazy, 619 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 173 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 16 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 248 ConstructedInterpolants, 0 QuantifiedInterpolants, 25750 SizeOfPredicates, 7 NumberOfNonLiveVariables, 455 ConjunctsInSsa, 77 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 0/392 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-5485861 [2020-10-25 19:35:17,620 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 19:35:17,624 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 19:35:17,697 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 19:35:17,698 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 19:35:17,699 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 19:35:17,701 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 19:35:17,704 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 19:35:17,707 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 19:35:17,708 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 19:35:17,710 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 19:35:17,712 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 19:35:17,712 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 19:35:17,714 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 19:35:17,715 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 19:35:17,717 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 19:35:17,719 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 19:35:17,720 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 19:35:17,722 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 19:35:17,725 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 19:35:17,728 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 19:35:17,729 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 19:35:17,731 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 19:35:17,733 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 19:35:17,737 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 19:35:17,737 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 19:35:17,738 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 19:35:17,739 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 19:35:17,740 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 19:35:17,741 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 19:35:17,742 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 19:35:17,743 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 19:35:17,744 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 19:35:17,745 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 19:35:17,747 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 19:35:17,748 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 19:35:17,749 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 19:35:17,749 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 19:35:17,750 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 19:35:17,751 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 19:35:17,752 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 19:35:17,755 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-10-25 19:35:17,792 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 19:35:17,793 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 19:35:17,798 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 19:35:17,798 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 19:35:17,798 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 19:35:17,799 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 19:35:17,799 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 19:35:17,799 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 19:35:17,799 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 19:35:17,799 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 19:35:17,800 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 19:35:17,800 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 19:35:17,800 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-10-25 19:35:17,801 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-10-25 19:35:17,801 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 19:35:17,801 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 19:35:17,801 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 19:35:17,802 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 19:35:17,802 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 19:35:17,802 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 19:35:17,803 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 19:35:17,803 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 19:35:17,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 19:35:17,804 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 19:35:17,804 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 19:35:17,804 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 19:35:17,804 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-10-25 19:35:17,805 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-10-25 19:35:17,805 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 19:35:17,805 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 19:35:17,805 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-25 19:35:17,806 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 22f8891fc10bb8c305de18eb9540699e7b8a01ce [2020-10-25 19:35:18,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 19:35:18,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 19:35:18,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 19:35:18,273 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 19:35:18,274 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 19:35:18,275 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/num_conversion_1.c [2020-10-25 19:35:18,369 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d37700714/187ab577a82845939c79fcc9b0a928ca/FLAG6884d7b4f [2020-10-25 19:35:19,032 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 19:35:19,033 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_1.c [2020-10-25 19:35:19,043 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d37700714/187ab577a82845939c79fcc9b0a928ca/FLAG6884d7b4f [2020-10-25 19:35:19,377 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d37700714/187ab577a82845939c79fcc9b0a928ca [2020-10-25 19:35:19,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 19:35:19,388 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 19:35:19,396 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 19:35:19,396 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 19:35:19,400 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 19:35:19,402 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 07:35:19" (1/1) ... [2020-10-25 19:35:19,427 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58cbacf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:19, skipping insertion in model container [2020-10-25 19:35:19,428 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 07:35:19" (1/1) ... [2020-10-25 19:35:19,449 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 19:35:19,481 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 19:35:19,644 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 19:35:19,662 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 19:35:19,684 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 19:35:19,702 INFO L208 MainTranslator]: Completed translation [2020-10-25 19:35:19,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:19 WrapperNode [2020-10-25 19:35:19,703 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 19:35:19,705 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 19:35:19,705 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 19:35:19,706 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 19:35:19,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:19" (1/1) ... [2020-10-25 19:35:19,726 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:19" (1/1) ... [2020-10-25 19:35:19,755 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 19:35:19,757 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 19:35:19,757 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 19:35:19,757 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 19:35:19,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:19" (1/1) ... [2020-10-25 19:35:19,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:19" (1/1) ... [2020-10-25 19:35:19,771 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:19" (1/1) ... [2020-10-25 19:35:19,771 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:19" (1/1) ... [2020-10-25 19:35:19,777 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:19" (1/1) ... [2020-10-25 19:35:19,782 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:19" (1/1) ... [2020-10-25 19:35:19,784 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:19" (1/1) ... [2020-10-25 19:35:19,787 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 19:35:19,789 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 19:35:19,789 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 19:35:19,789 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 19:35:19,790 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 19:35:19,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 19:35:19,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 19:35:19,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-10-25 19:35:19,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 19:35:20,131 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 19:35:20,132 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-10-25 19:35:20,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:35:20 BoogieIcfgContainer [2020-10-25 19:35:20,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 19:35:20,141 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 19:35:20,141 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 19:35:20,145 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 19:35:20,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 07:35:19" (1/3) ... [2020-10-25 19:35:20,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c21867c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 07:35:20, skipping insertion in model container [2020-10-25 19:35:20,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:35:19" (2/3) ... [2020-10-25 19:35:20,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c21867c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 07:35:20, skipping insertion in model container [2020-10-25 19:35:20,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:35:20" (3/3) ... [2020-10-25 19:35:20,151 INFO L111 eAbstractionObserver]: Analyzing ICFG num_conversion_1.c [2020-10-25 19:35:20,166 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 19:35:20,172 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-25 19:35:20,189 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-25 19:35:20,258 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 19:35:20,259 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 19:35:20,259 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 19:35:20,260 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 19:35:20,262 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 19:35:20,263 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 19:35:20,263 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 19:35:20,263 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 19:35:20,287 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2020-10-25 19:35:20,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-10-25 19:35:20,294 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:20,296 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-10-25 19:35:20,296 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:20,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:20,304 INFO L82 PathProgramCache]: Analyzing trace with hash 889968487, now seen corresponding path program 1 times [2020-10-25 19:35:20,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 19:35:20,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1114343886] [2020-10-25 19:35:20,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-10-25 19:35:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:20,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 1 conjunts are in the unsatisfiable core [2020-10-25 19:35:20,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:35:20,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:35:20,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 19:35:20,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:35:20,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1114343886] [2020-10-25 19:35:20,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:35:20,455 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-10-25 19:35:20,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295174796] [2020-10-25 19:35:20,462 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-25 19:35:20,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 19:35:20,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-25 19:35:20,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-25 19:35:20,483 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2020-10-25 19:35:20,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:20,504 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2020-10-25 19:35:20,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-25 19:35:20,506 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2020-10-25 19:35:20,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:20,517 INFO L225 Difference]: With dead ends: 22 [2020-10-25 19:35:20,518 INFO L226 Difference]: Without dead ends: 9 [2020-10-25 19:35:20,521 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-25 19:35:20,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2020-10-25 19:35:20,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-10-25 19:35:20,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-25 19:35:20,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2020-10-25 19:35:20,565 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2020-10-25 19:35:20,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:20,566 INFO L481 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-10-25 19:35:20,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-25 19:35:20,566 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2020-10-25 19:35:20,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-10-25 19:35:20,567 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:20,567 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-10-25 19:35:20,788 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-25 19:35:20,788 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:20,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:20,790 INFO L82 PathProgramCache]: Analyzing trace with hash 889640786, now seen corresponding path program 1 times [2020-10-25 19:35:20,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 19:35:20,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [475328978] [2020-10-25 19:35:20,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-10-25 19:35:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:20,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-25 19:35:20,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:35:20,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:35:20,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 19:35:20,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:35:20,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [475328978] [2020-10-25 19:35:20,925 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:35:20,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2020-10-25 19:35:20,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874723305] [2020-10-25 19:35:20,927 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:35:20,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 19:35:20,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:35:20,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:35:20,930 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 4 states. [2020-10-25 19:35:20,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:20,962 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2020-10-25 19:35:20,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 19:35:20,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-10-25 19:35:20,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:20,964 INFO L225 Difference]: With dead ends: 17 [2020-10-25 19:35:20,964 INFO L226 Difference]: Without dead ends: 13 [2020-10-25 19:35:20,965 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:35:20,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-10-25 19:35:20,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-10-25 19:35:20,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-25 19:35:20,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2020-10-25 19:35:20,970 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 6 [2020-10-25 19:35:20,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:20,970 INFO L481 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2020-10-25 19:35:20,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:35:20,971 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2020-10-25 19:35:20,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-25 19:35:20,971 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:20,971 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-10-25 19:35:21,189 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-25 19:35:21,193 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:21,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:21,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1950053902, now seen corresponding path program 1 times [2020-10-25 19:35:21,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 19:35:21,202 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [558204582] [2020-10-25 19:35:21,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-10-25 19:35:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:21,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-25 19:35:21,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:35:21,288 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-25 19:35:21,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 19:35:21,354 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-25 19:35:21,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [558204582] [2020-10-25 19:35:21,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:35:21,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-10-25 19:35:21,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134348988] [2020-10-25 19:35:21,359 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 19:35:21,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 19:35:21,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 19:35:21,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-25 19:35:21,362 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 6 states. [2020-10-25 19:35:21,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:21,484 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-10-25 19:35:21,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-25 19:35:21,485 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-10-25 19:35:21,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:21,486 INFO L225 Difference]: With dead ends: 28 [2020-10-25 19:35:21,486 INFO L226 Difference]: Without dead ends: 19 [2020-10-25 19:35:21,488 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-25 19:35:21,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-10-25 19:35:21,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 13. [2020-10-25 19:35:21,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-25 19:35:21,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2020-10-25 19:35:21,498 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 12 [2020-10-25 19:35:21,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:21,498 INFO L481 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-10-25 19:35:21,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 19:35:21,499 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-10-25 19:35:21,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-25 19:35:21,499 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:21,499 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:35:21,700 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-25 19:35:21,700 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:21,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:21,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1664855024, now seen corresponding path program 1 times [2020-10-25 19:35:21,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 19:35:21,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1570231805] [2020-10-25 19:35:21,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-10-25 19:35:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:35:21,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-25 19:35:21,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:35:21,803 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:35:21,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 19:35:21,865 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:35:21,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1570231805] [2020-10-25 19:35:21,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 19:35:21,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2020-10-25 19:35:21,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078271094] [2020-10-25 19:35:21,872 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-25 19:35:21,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 19:35:21,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-25 19:35:21,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-25 19:35:21,876 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 8 states. [2020-10-25 19:35:22,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:22,007 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2020-10-25 19:35:22,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-25 19:35:22,008 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2020-10-25 19:35:22,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:22,009 INFO L225 Difference]: With dead ends: 29 [2020-10-25 19:35:22,009 INFO L226 Difference]: Without dead ends: 25 [2020-10-25 19:35:22,010 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-10-25 19:35:22,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-10-25 19:35:22,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-10-25 19:35:22,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-25 19:35:22,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2020-10-25 19:35:22,017 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 12 [2020-10-25 19:35:22,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:22,018 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2020-10-25 19:35:22,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-25 19:35:22,018 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2020-10-25 19:35:22,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-25 19:35:22,019 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:22,019 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:35:22,235 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-25 19:35:22,236 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:22,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:22,237 INFO L82 PathProgramCache]: Analyzing trace with hash 2085526576, now seen corresponding path program 2 times [2020-10-25 19:35:22,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 19:35:22,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [60607648] [2020-10-25 19:35:22,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-10-25 19:35:22,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-25 19:35:22,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 19:35:22,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-25 19:35:22,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:35:22,374 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 29 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-25 19:35:22,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 19:35:22,474 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 29 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-25 19:35:22,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [60607648] [2020-10-25 19:35:22,475 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 19:35:22,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2020-10-25 19:35:22,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765034829] [2020-10-25 19:35:22,476 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-25 19:35:22,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 19:35:22,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-25 19:35:22,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-25 19:35:22,478 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand 10 states. [2020-10-25 19:35:22,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:22,756 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2020-10-25 19:35:22,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-25 19:35:22,757 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-10-25 19:35:22,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:22,758 INFO L225 Difference]: With dead ends: 54 [2020-10-25 19:35:22,758 INFO L226 Difference]: Without dead ends: 39 [2020-10-25 19:35:22,759 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-25 19:35:22,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-10-25 19:35:22,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2020-10-25 19:35:22,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-10-25 19:35:22,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2020-10-25 19:35:22,767 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 24 [2020-10-25 19:35:22,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:22,768 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2020-10-25 19:35:22,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-25 19:35:22,768 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2020-10-25 19:35:22,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-25 19:35:22,769 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:22,769 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 1, 1, 1, 1, 1, 1] [2020-10-25 19:35:22,982 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-10-25 19:35:22,983 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:22,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:22,984 INFO L82 PathProgramCache]: Analyzing trace with hash -986835344, now seen corresponding path program 3 times [2020-10-25 19:35:22,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 19:35:22,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1167020357] [2020-10-25 19:35:22,985 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-10-25 19:35:23,041 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-10-25 19:35:23,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 19:35:23,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-25 19:35:23,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:35:23,184 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-10-25 19:35:23,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 19:35:23,356 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-10-25 19:35:23,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1167020357] [2020-10-25 19:35:23,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 19:35:23,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2020-10-25 19:35:23,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815558440] [2020-10-25 19:35:23,358 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-25 19:35:23,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 19:35:23,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-25 19:35:23,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-10-25 19:35:23,360 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 10 states. [2020-10-25 19:35:23,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:23,680 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2020-10-25 19:35:23,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-25 19:35:23,681 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-10-25 19:35:23,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:23,682 INFO L225 Difference]: With dead ends: 53 [2020-10-25 19:35:23,682 INFO L226 Difference]: Without dead ends: 31 [2020-10-25 19:35:23,683 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2020-10-25 19:35:23,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-10-25 19:35:23,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-10-25 19:35:23,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-25 19:35:23,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2020-10-25 19:35:23,691 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 24 [2020-10-25 19:35:23,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:23,692 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2020-10-25 19:35:23,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-25 19:35:23,692 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2020-10-25 19:35:23,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-25 19:35:23,693 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:23,694 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 5, 3, 1, 1, 1, 1, 1, 1] [2020-10-25 19:35:23,912 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-10-25 19:35:23,912 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:23,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:23,913 INFO L82 PathProgramCache]: Analyzing trace with hash -29656432, now seen corresponding path program 4 times [2020-10-25 19:35:23,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 19:35:23,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1592245007] [2020-10-25 19:35:23,914 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-10-25 19:35:23,967 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-25 19:35:23,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 19:35:23,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 17 conjunts are in the unsatisfiable core [2020-10-25 19:35:23,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:35:24,268 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-10-25 19:35:24,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 19:35:25,171 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-10-25 19:35:25,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1592245007] [2020-10-25 19:35:25,173 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 19:35:25,173 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2020-10-25 19:35:25,174 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653067727] [2020-10-25 19:35:25,175 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-10-25 19:35:25,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 19:35:25,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-10-25 19:35:25,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2020-10-25 19:35:25,178 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 28 states. [2020-10-25 19:35:26,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:26,603 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2020-10-25 19:35:26,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-25 19:35:26,603 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 30 [2020-10-25 19:35:26,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:26,604 INFO L225 Difference]: With dead ends: 53 [2020-10-25 19:35:26,604 INFO L226 Difference]: Without dead ends: 37 [2020-10-25 19:35:26,606 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=152, Invalid=1108, Unknown=0, NotChecked=0, Total=1260 [2020-10-25 19:35:26,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-10-25 19:35:26,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-10-25 19:35:26,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-25 19:35:26,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2020-10-25 19:35:26,614 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 30 [2020-10-25 19:35:26,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:26,615 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2020-10-25 19:35:26,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-10-25 19:35:26,615 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2020-10-25 19:35:26,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-10-25 19:35:26,616 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:35:26,617 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 6, 4, 1, 1, 1, 1, 1, 1] [2020-10-25 19:35:26,838 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-10-25 19:35:26,840 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:35:26,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:35:26,840 INFO L82 PathProgramCache]: Analyzing trace with hash -166593550, now seen corresponding path program 5 times [2020-10-25 19:35:26,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 19:35:26,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1354231265] [2020-10-25 19:35:26,842 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-10-25 19:35:26,887 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2020-10-25 19:35:26,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 19:35:26,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 17 conjunts are in the unsatisfiable core [2020-10-25 19:35:26,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 19:35:27,905 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-25 19:35:27,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 19:35:28,832 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-25 19:35:28,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1354231265] [2020-10-25 19:35:28,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:35:28,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18, 18] imperfect sequences [] total 34 [2020-10-25 19:35:28,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248464782] [2020-10-25 19:35:28,834 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2020-10-25 19:35:28,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 19:35:28,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2020-10-25 19:35:28,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=746, Unknown=0, NotChecked=0, Total=1122 [2020-10-25 19:35:28,836 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 34 states. [2020-10-25 19:35:29,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:35:29,068 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2020-10-25 19:35:29,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-25 19:35:29,069 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 36 [2020-10-25 19:35:29,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:35:29,070 INFO L225 Difference]: With dead ends: 39 [2020-10-25 19:35:29,070 INFO L226 Difference]: Without dead ends: 0 [2020-10-25 19:35:29,078 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=376, Invalid=746, Unknown=0, NotChecked=0, Total=1122 [2020-10-25 19:35:29,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-25 19:35:29,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-25 19:35:29,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-25 19:35:29,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-25 19:35:29,080 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2020-10-25 19:35:29,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:35:29,081 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-25 19:35:29,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2020-10-25 19:35:29,083 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-25 19:35:29,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-25 19:35:29,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-10-25 19:35:29,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-25 19:35:29,502 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 188 [2020-10-25 19:35:30,292 WARN L193 SmtUtils]: Spent 781.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 140 [2020-10-25 19:35:30,298 INFO L277 CegarLoopResult]: At program point L33(lines 14 34) the Hoare annotation is: true [2020-10-25 19:35:30,298 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-10-25 19:35:30,299 INFO L270 CegarLoopResult]: At program point L23-2(lines 23 30) the Hoare annotation is: (let ((.cse14 ((_ zero_extend 24) ULTIMATE.start_main_~c~0))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse14 (_ bv1 32)))))) (let ((.cse16 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse17 (_ bv1 32)))))) (let ((.cse11 ((_ zero_extend 24) ULTIMATE.start_main_~x~0)) (.cse15 ((_ zero_extend 24) ULTIMATE.start_main_~y~0)) (.cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse16))))) (let ((.cse2 (exists ((v_ULTIMATE.start_main_~c~0_28 (_ BitVec 8))) (let ((.cse25 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_28))) (and (= ((_ extract 7 0) (bvadd .cse25 (_ bv1 32))) ULTIMATE.start_main_~c~0) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv37 32) ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse25)))))) (_ bv0 32))))))) (.cse0 (= (_ bv5 8) ULTIMATE.start_main_~y~0)) (.cse13 (or (bvslt .cse17 (_ bv8 32)) (= (_ bv0 32) ((_ zero_extend 24) ULTIMATE.start_main_~bit~0)))) (.cse3 (= .cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse15 .cse12))))) (.cse10 (= (_ bv1 8) ULTIMATE.start_main_~y~0)) (.cse1 (= (_ bv37 8) ULTIMATE.start_main_~x~0))) (or (and .cse0 (= (_ bv4 8) ULTIMATE.start_main_~c~0) .cse1) (and .cse1 .cse2 .cse3 (exists ((v_ULTIMATE.start_main_~c~0_50 (_ BitVec 8))) (let ((.cse9 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_50))) (let ((.cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse9 (_ bv1 32)))))) (let ((.cse5 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse6 (_ bv1 32)))))) (let ((.cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse5 (_ bv1 32)))))) (let ((.cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse4 (_ bv1 32)))))) (let ((.cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse7 (_ bv1 32)))))) (and (bvslt .cse4 (_ bv8 32)) (bvslt .cse5 (_ bv8 32)) (bvslt .cse6 (_ bv8 32)) (bvslt .cse7 (_ bv8 32)) (bvslt .cse8 (_ bv8 32)) (bvslt .cse9 (_ bv8 32)) (= ((_ extract 7 0) (bvadd .cse8 (_ bv1 32))) ULTIMATE.start_main_~c~0)))))))))) (and (= (_ bv2 8) ULTIMATE.start_main_~c~0) .cse1 .cse10) (and .cse0 (= (_ bv0 8) (bvadd ULTIMATE.start_main_~bit~0 (_ bv252 8))) .cse1 (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse11 .cse12))) (_ bv0 32))) .cse2) (and .cse13 (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse14))) .cse15))) .cse11) (= .cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse16 (_ bv1 32)))) (_ bv1 32))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse17)))))))))) .cse1) (and .cse0 .cse1 (= (_ bv5 8) ULTIMATE.start_main_~c~0)) (and .cse13 (exists ((v_ULTIMATE.start_main_~c~0_50 (_ BitVec 8))) (let ((.cse24 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_50))) (let ((.cse20 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse24 (_ bv1 32)))))) (let ((.cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse20 (_ bv1 32)))))) (let ((.cse18 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse19 (_ bv1 32)))))) (let ((.cse21 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse18 (_ bv1 32)))))) (let ((.cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse21 (_ bv1 32)))))) (let ((.cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse22 (_ bv1 32)))))) (and (bvslt .cse18 (_ bv8 32)) (bvslt .cse19 (_ bv8 32)) (bvslt .cse20 (_ bv8 32)) (bvslt .cse21 (_ bv8 32)) (bvslt .cse22 (_ bv8 32)) (bvslt .cse23 (_ bv8 32)) (bvslt .cse24 (_ bv8 32)) (= ULTIMATE.start_main_~c~0 ((_ extract 7 0) (bvadd .cse23 (_ bv1 32))))))))))))) .cse1 .cse3) (and (= (_ bv0 8) (bvadd ULTIMATE.start_main_~bit~0 (_ bv255 8))) (= (_ bv1 8) ULTIMATE.start_main_~c~0) .cse1 .cse10) (and (= (_ bv0 8) ULTIMATE.start_main_~c~0) .cse1 (= (_ bv0 8) ULTIMATE.start_main_~y~0)))))))) [2020-10-25 19:35:30,299 INFO L274 CegarLoopResult]: For program point L23-3(lines 23 30) no Hoare annotation was computed. [2020-10-25 19:35:30,299 INFO L274 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-10-25 19:35:30,299 INFO L277 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: true [2020-10-25 19:35:30,299 INFO L274 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-10-25 19:35:30,299 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-10-25 19:35:30,299 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-10-25 19:35:30,299 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-10-25 19:35:30,299 INFO L274 CegarLoopResult]: For program point L26(lines 26 28) no Hoare annotation was computed. [2020-10-25 19:35:30,300 INFO L274 CegarLoopResult]: For program point L26-2(lines 26 28) no Hoare annotation was computed. [2020-10-25 19:35:30,300 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-25 19:35:30,300 INFO L274 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-10-25 19:35:30,313 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_28,QUANTIFIED] [2020-10-25 19:35:30,314 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_28,QUANTIFIED] [2020-10-25 19:35:30,315 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,315 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,315 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,316 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,316 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,316 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_28,QUANTIFIED] [2020-10-25 19:35:30,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_28,QUANTIFIED] [2020-10-25 19:35:30,318 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,318 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,318 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,319 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,319 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,319 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,320 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,320 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_28,QUANTIFIED] [2020-10-25 19:35:30,345 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_28,QUANTIFIED] [2020-10-25 19:35:30,345 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,348 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_28,QUANTIFIED] [2020-10-25 19:35:30,350 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_28,QUANTIFIED] [2020-10-25 19:35:30,351 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,351 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,351 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,352 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,352 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,352 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,352 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 07:35:30 BoogieIcfgContainer [2020-10-25 19:35:30,364 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 19:35:30,365 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 19:35:30,366 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 19:35:30,366 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 19:35:30,367 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:35:20" (3/4) ... [2020-10-25 19:35:30,373 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-25 19:35:30,386 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2020-10-25 19:35:30,386 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-10-25 19:35:30,387 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-25 19:35:30,387 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-25 19:35:30,424 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((5bv8 == y && 4bv8 == c) && 37bv8 == x) || (((37bv8 == x && (\exists v_ULTIMATE.start_main_~c~0_28 : bv8 :: ~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_28), 1bv32)[7:0] == c && !(~zero_extendFrom8To32(~bvand32(37bv32, ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_28))[7:0]))[7:0]) == 0bv32))) && ~zero_extendFrom8To32(x) == ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(y), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0])) && (\exists v_ULTIMATE.start_main_~c~0_50 : bv8 :: (((((~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_50), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_50), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_50), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_50), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_50), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_50), 8bv32)) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_50), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0] == c))) || ((2bv8 == c && 37bv8 == x) && 1bv8 == y)) || ((((5bv8 == y && 0bv8 == ~bvadd64(bit, 252bv8)) && 37bv8 == x) && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32)) && (\exists v_ULTIMATE.start_main_~c~0_28 : bv8 :: ~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_28), 1bv32)[7:0] == c && !(~zero_extendFrom8To32(~bvand32(37bv32, ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_28))[7:0]))[7:0]) == 0bv32)))) || ((((~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]), 8bv32) || 0bv32 == ~zero_extendFrom8To32(bit)) && ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(c))[7:0]), ~zero_extendFrom8To32(y))[7:0]) == ~zero_extendFrom8To32(x)) && ~zero_extendFrom8To32(x) == ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(y), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]))[7:0]))[7:0]))[7:0])) && 37bv8 == x)) || ((5bv8 == y && 37bv8 == x) && 5bv8 == c)) || ((((~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]), 8bv32) || 0bv32 == ~zero_extendFrom8To32(bit)) && (\exists v_ULTIMATE.start_main_~c~0_50 : bv8 :: ((((((~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_50), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_50), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_50), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_50), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_50), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_50), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_50), 8bv32)) && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_50), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0])) && 37bv8 == x) && ~zero_extendFrom8To32(x) == ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(y), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]))) || (((0bv8 == ~bvadd64(bit, 255bv8) && 1bv8 == c) && 37bv8 == x) && 1bv8 == y)) || ((0bv8 == c && 37bv8 == x) && 0bv8 == y) [2020-10-25 19:35:30,452 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-25 19:35:30,452 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 19:35:30,457 INFO L168 Benchmark]: Toolchain (without parser) took 11070.85 ms. Allocated memory was 44.0 MB in the beginning and 81.8 MB in the end (delta: 37.7 MB). Free memory was 22.1 MB in the beginning and 63.6 MB in the end (delta: -41.5 MB). Peak memory consumption was 39.7 MB. Max. memory is 16.1 GB. [2020-10-25 19:35:30,462 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 44.0 MB. Free memory was 27.6 MB in the beginning and 27.5 MB in the end (delta: 32.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 19:35:30,463 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.48 ms. Allocated memory is still 44.0 MB. Free memory was 21.5 MB in the beginning and 21.1 MB in the end (delta: 398.8 kB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. [2020-10-25 19:35:30,464 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.82 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 21.0 MB in the beginning and 39.9 MB in the end (delta: -18.9 MB). Peak memory consumption was 4.8 MB. Max. memory is 16.1 GB. [2020-10-25 19:35:30,467 INFO L168 Benchmark]: Boogie Preprocessor took 31.05 ms. Allocated memory is still 54.5 MB. Free memory was 39.9 MB in the beginning and 38.6 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 19:35:30,468 INFO L168 Benchmark]: RCFGBuilder took 350.33 ms. Allocated memory is still 54.5 MB. Free memory was 38.6 MB in the beginning and 27.3 MB in the end (delta: 11.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-10-25 19:35:30,469 INFO L168 Benchmark]: TraceAbstraction took 10224.15 ms. Allocated memory was 54.5 MB in the beginning and 81.8 MB in the end (delta: 27.3 MB). Free memory was 26.9 MB in the beginning and 24.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 31.8 MB. Max. memory is 16.1 GB. [2020-10-25 19:35:30,469 INFO L168 Benchmark]: Witness Printer took 87.03 ms. Allocated memory is still 81.8 MB. Free memory was 24.9 MB in the beginning and 63.6 MB in the end (delta: -38.7 MB). Peak memory consumption was 2.2 MB. Max. memory is 16.1 GB. [2020-10-25 19:35:30,477 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37 ms. Allocated memory is still 44.0 MB. Free memory was 27.6 MB in the beginning and 27.5 MB in the end (delta: 32.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 308.48 ms. Allocated memory is still 44.0 MB. Free memory was 21.5 MB in the beginning and 21.1 MB in the end (delta: 398.8 kB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 50.82 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 21.0 MB in the beginning and 39.9 MB in the end (delta: -18.9 MB). Peak memory consumption was 4.8 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 31.05 ms. Allocated memory is still 54.5 MB. Free memory was 39.9 MB in the beginning and 38.6 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 350.33 ms. Allocated memory is still 54.5 MB. Free memory was 38.6 MB in the beginning and 27.3 MB in the end (delta: 11.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 10224.15 ms. Allocated memory was 54.5 MB in the beginning and 81.8 MB in the end (delta: 27.3 MB). Free memory was 26.9 MB in the beginning and 24.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 31.8 MB. Max. memory is 16.1 GB. * Witness Printer took 87.03 ms. Allocated memory is still 81.8 MB. Free memory was 24.9 MB in the beginning and 63.6 MB in the end (delta: -38.7 MB). Peak memory consumption was 2.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 23]: Loop Invariant [2020-10-25 19:35:30,499 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_28,QUANTIFIED] [2020-10-25 19:35:30,499 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_28,QUANTIFIED] [2020-10-25 19:35:30,499 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,499 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,500 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,500 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,500 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,501 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,501 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,502 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_28,QUANTIFIED] [2020-10-25 19:35:30,502 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_28,QUANTIFIED] [2020-10-25 19:35:30,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,504 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,505 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,505 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,506 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,506 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,512 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_28,QUANTIFIED] [2020-10-25 19:35:30,513 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_28,QUANTIFIED] [2020-10-25 19:35:30,513 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,513 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,514 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,514 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,515 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_28,QUANTIFIED] [2020-10-25 19:35:30,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_28,QUANTIFIED] [2020-10-25 19:35:30,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2020-10-25 19:35:30,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] Derived loop invariant: (((((((((5bv8 == y && 4bv8 == c) && 37bv8 == x) || (((37bv8 == x && (\exists v_ULTIMATE.start_main_~c~0_28 : bv8 :: ~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_28), 1bv32)[7:0] == c && !(~zero_extendFrom8To32(~bvand32(37bv32, ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_28))[7:0]))[7:0]) == 0bv32))) && ~zero_extendFrom8To32(x) == ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(y), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0])) && (\exists v_ULTIMATE.start_main_~c~0_50 : bv8 :: (((((~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_50), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_50), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_50), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_50), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_50), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_50), 8bv32)) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_50), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0] == c))) || ((2bv8 == c && 37bv8 == x) && 1bv8 == y)) || ((((5bv8 == y && 0bv8 == ~bvadd64(bit, 252bv8)) && 37bv8 == x) && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(x), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]) == 0bv32)) && (\exists v_ULTIMATE.start_main_~c~0_28 : bv8 :: ~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_28), 1bv32)[7:0] == c && !(~zero_extendFrom8To32(~bvand32(37bv32, ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_28))[7:0]))[7:0]) == 0bv32)))) || ((((~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]), 8bv32) || 0bv32 == ~zero_extendFrom8To32(bit)) && ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(c))[7:0]), ~zero_extendFrom8To32(y))[7:0]) == ~zero_extendFrom8To32(x)) && ~zero_extendFrom8To32(x) == ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(y), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]))[7:0]))[7:0]))[7:0])) && 37bv8 == x)) || ((5bv8 == y && 37bv8 == x) && 5bv8 == c)) || ((((~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]), 8bv32) || 0bv32 == ~zero_extendFrom8To32(bit)) && (\exists v_ULTIMATE.start_main_~c~0_50 : bv8 :: ((((((~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_50), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_50), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_50), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_50), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_50), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_50), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_50), 8bv32)) && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_50), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0])) && 37bv8 == x) && ~zero_extendFrom8To32(x) == ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(y), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]))) || (((0bv8 == ~bvadd64(bit, 255bv8) && 1bv8 == c) && 37bv8 == x) && 1bv8 == y)) || ((0bv8 == c && 37bv8 == x) && 0bv8 == y) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 9.0s, OverallIterations: 8, TraceHistogramMax: 10, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 77 SDtfs, 143 SDslu, 316 SDs, 0 SdLazy, 697 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 310 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 19 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 16 NumberOfFragments, 533 HoareAnnotationTreeSize, 3 FomulaSimplifications, 127 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 671 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 150 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 284 ConstructedInterpolants, 39 QuantifiedInterpolants, 129955 SizeOfPredicates, 25 NumberOfNonLiveVariables, 361 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 16 InterpolantComputations, 8 PerfectInterpolantSequences, 472/698 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...