./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 20ed64ec 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.1-dev-20ed64e [2021-08-25 19:58:33,006 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 19:58:33,008 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 19:58:33,037 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 19:58:33,037 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 19:58:33,040 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 19:58:33,041 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 19:58:33,045 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 19:58:33,047 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 19:58:33,050 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 19:58:33,051 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 19:58:33,058 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 19:58:33,058 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 19:58:33,060 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 19:58:33,061 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 19:58:33,066 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 19:58:33,066 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 19:58:33,069 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 19:58:33,071 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 19:58:33,075 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 19:58:33,076 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 19:58:33,077 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 19:58:33,078 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 19:58:33,079 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 19:58:33,082 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 19:58:33,082 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 19:58:33,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 19:58:33,083 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 19:58:33,084 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 19:58:33,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 19:58:33,084 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 19:58:33,085 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 19:58:33,086 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 19:58:33,086 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 19:58:33,087 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 19:58:33,087 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 19:58:33,088 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 19:58:33,088 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 19:58:33,088 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 19:58:33,089 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 19:58:33,090 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 19:58:33,093 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-25 19:58:33,122 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 19:58:33,123 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 19:58:33,123 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 19:58:33,124 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 19:58:33,125 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 19:58:33,125 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 19:58:33,125 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 19:58:33,125 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 19:58:33,125 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 19:58:33,125 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-25 19:58:33,126 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 19:58:33,126 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 19:58:33,126 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 19:58:33,126 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 19:58:33,126 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 19:58:33,127 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 19:58:33,127 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 19:58:33,127 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 19:58:33,127 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 19:58:33,127 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 19:58:33,127 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 19:58:33,127 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 19:58:33,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 19:58:33,127 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 19:58:33,127 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 19:58:33,128 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 19:58:33,128 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-25 19:58:33,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-25 19:58:33,128 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 19:58:33,128 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 19:58:33,128 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 [2021-08-25 19:58:33,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 19:58:33,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 19:58:33,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 19:58:33,424 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 19:58:33,424 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 19:58:33,425 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/num_conversion_1.c [2021-08-25 19:58:33,470 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02a08e415/1de7dc3c2ed142a0b33b80902b5da9bb/FLAG37a31455f [2021-08-25 19:58:33,828 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 19:58:33,828 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_1.c [2021-08-25 19:58:33,833 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02a08e415/1de7dc3c2ed142a0b33b80902b5da9bb/FLAG37a31455f [2021-08-25 19:58:33,843 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02a08e415/1de7dc3c2ed142a0b33b80902b5da9bb [2021-08-25 19:58:33,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 19:58:33,846 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 19:58:33,848 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 19:58:33,848 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 19:58:33,851 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 19:58:33,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 07:58:33" (1/1) ... [2021-08-25 19:58:33,852 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3849a562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:58:33, skipping insertion in model container [2021-08-25 19:58:33,852 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 07:58:33" (1/1) ... [2021-08-25 19:58:33,856 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 19:58:33,864 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 19:58:33,980 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_1.c[368,381] [2021-08-25 19:58:33,994 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 19:58:33,999 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 19:58:34,012 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_1.c[368,381] [2021-08-25 19:58:34,016 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 19:58:34,036 INFO L208 MainTranslator]: Completed translation [2021-08-25 19:58:34,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:58:34 WrapperNode [2021-08-25 19:58:34,038 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 19:58:34,040 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 19:58:34,041 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 19:58:34,041 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 19:58:34,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:58:34" (1/1) ... [2021-08-25 19:58:34,050 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:58:34" (1/1) ... [2021-08-25 19:58:34,061 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 19:58:34,061 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 19:58:34,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 19:58:34,062 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 19:58:34,066 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:58:34" (1/1) ... [2021-08-25 19:58:34,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:58:34" (1/1) ... [2021-08-25 19:58:34,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:58:34" (1/1) ... [2021-08-25 19:58:34,071 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:58:34" (1/1) ... [2021-08-25 19:58:34,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:58:34" (1/1) ... [2021-08-25 19:58:34,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:58:34" (1/1) ... [2021-08-25 19:58:34,080 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:58:34" (1/1) ... [2021-08-25 19:58:34,081 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 19:58:34,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 19:58:34,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 19:58:34,081 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 19:58:34,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:58:34" (1/1) ... [2021-08-25 19:58:34,087 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 19:58:34,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 19:58:34,108 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-25 19:58:34,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-25 19:58:34,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 19:58:34,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 19:58:34,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-25 19:58:34,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 19:58:34,349 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 19:58:34,350 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-25 19:58:34,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 07:58:34 BoogieIcfgContainer [2021-08-25 19:58:34,351 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 19:58:34,352 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 19:58:34,352 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 19:58:34,354 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 19:58:34,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 07:58:33" (1/3) ... [2021-08-25 19:58:34,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@251d45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 07:58:34, skipping insertion in model container [2021-08-25 19:58:34,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:58:34" (2/3) ... [2021-08-25 19:58:34,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@251d45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 07:58:34, skipping insertion in model container [2021-08-25 19:58:34,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 07:58:34" (3/3) ... [2021-08-25 19:58:34,356 INFO L111 eAbstractionObserver]: Analyzing ICFG num_conversion_1.c [2021-08-25 19:58:34,359 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 19:58:34,359 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 19:58:34,432 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 19:58:34,446 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-25 19:58:34,446 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 19:58:34,454 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:34,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-08-25 19:58:34,457 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:58:34,458 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-08-25 19:58:34,458 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:58:34,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:58:34,461 INFO L82 PathProgramCache]: Analyzing trace with hash 889968487, now seen corresponding path program 1 times [2021-08-25 19:58:34,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:58:34,467 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548661938] [2021-08-25 19:58:34,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:58:34,468 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:58:34,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:58:34,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:58:34,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:58:34,584 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548661938] [2021-08-25 19:58:34,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548661938] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 19:58:34,584 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:58:34,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-25 19:58:34,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016156918] [2021-08-25 19:58:34,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-25 19:58:34,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:58:34,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-25 19:58:34,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-25 19:58:34,597 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:34,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:58:34,605 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2021-08-25 19:58:34,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-25 19:58:34,606 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-08-25 19:58:34,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:58:34,610 INFO L225 Difference]: With dead ends: 21 [2021-08-25 19:58:34,611 INFO L226 Difference]: Without dead ends: 9 [2021-08-25 19:58:34,613 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-25 19:58:34,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2021-08-25 19:58:34,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2021-08-25 19:58:34,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:34,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2021-08-25 19:58:34,631 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2021-08-25 19:58:34,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:58:34,632 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2021-08-25 19:58:34,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:34,632 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2021-08-25 19:58:34,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-08-25 19:58:34,633 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:58:34,633 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-08-25 19:58:34,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-25 19:58:34,634 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:58:34,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:58:34,640 INFO L82 PathProgramCache]: Analyzing trace with hash 889640786, now seen corresponding path program 1 times [2021-08-25 19:58:34,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:58:34,640 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249711140] [2021-08-25 19:58:34,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:58:34,640 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:58:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:58:34,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:58:34,724 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:58:34,724 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249711140] [2021-08-25 19:58:34,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249711140] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 19:58:34,724 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:58:34,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 19:58:34,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309234528] [2021-08-25 19:58:34,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 19:58:34,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:58:34,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 19:58:34,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:58:34,726 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:34,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:58:34,751 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2021-08-25 19:58:34,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 19:58:34,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-08-25 19:58:34,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:58:34,752 INFO L225 Difference]: With dead ends: 16 [2021-08-25 19:58:34,752 INFO L226 Difference]: Without dead ends: 12 [2021-08-25 19:58:34,752 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 19:58:34,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2021-08-25 19:58:34,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2021-08-25 19:58:34,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:34,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2021-08-25 19:58:34,754 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2021-08-25 19:58:34,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:58:34,754 INFO L470 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2021-08-25 19:58:34,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:34,755 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2021-08-25 19:58:34,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-08-25 19:58:34,755 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:58:34,755 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:58:34,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-25 19:58:34,755 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:58:34,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:58:34,756 INFO L82 PathProgramCache]: Analyzing trace with hash 641725625, now seen corresponding path program 1 times [2021-08-25 19:58:34,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:58:34,756 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364997729] [2021-08-25 19:58:34,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:58:34,756 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:58:34,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:58:34,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:58:34,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:58:34,854 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364997729] [2021-08-25 19:58:34,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364997729] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 19:58:34,854 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721631016] [2021-08-25 19:58:34,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:58:34,854 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 19:58:34,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 19:58:34,863 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 19:58:34,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-25 19:58:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:58:34,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-25 19:58:34,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:58:34,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:58:34,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721631016] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 19:58:34,994 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 19:58:34,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-08-25 19:58:34,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156050438] [2021-08-25 19:58:34,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 19:58:34,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:58:34,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 19:58:34,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 19:58:34,996 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:35,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:58:35,036 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2021-08-25 19:58:35,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 19:58:35,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-08-25 19:58:35,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:58:35,037 INFO L225 Difference]: With dead ends: 19 [2021-08-25 19:58:35,038 INFO L226 Difference]: Without dead ends: 15 [2021-08-25 19:58:35,038 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 19.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 19:58:35,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-08-25 19:58:35,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2021-08-25 19:58:35,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:35,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2021-08-25 19:58:35,040 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 9 [2021-08-25 19:58:35,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:58:35,041 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-08-25 19:58:35,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:35,041 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2021-08-25 19:58:35,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-25 19:58:35,041 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:58:35,041 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-08-25 19:58:35,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-08-25 19:58:35,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 19:58:35,257 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:58:35,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:58:35,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1950053902, now seen corresponding path program 2 times [2021-08-25 19:58:35,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:58:35,258 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239813906] [2021-08-25 19:58:35,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:58:35,259 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:58:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:58:35,325 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:58:35,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:58:35,325 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239813906] [2021-08-25 19:58:35,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239813906] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 19:58:35,326 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553691875] [2021-08-25 19:58:35,326 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-25 19:58:35,326 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 19:58:35,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 19:58:35,348 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 19:58:35,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-25 19:58:35,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-25 19:58:35,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 19:58:35,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-25 19:58:35,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:58:35,565 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:58:35,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553691875] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 19:58:35,565 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 19:58:35,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-08-25 19:58:35,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650747365] [2021-08-25 19:58:35,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-25 19:58:35,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:58:35,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-25 19:58:35,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-08-25 19:58:35,567 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:35,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:58:35,601 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2021-08-25 19:58:35,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 19:58:35,602 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-25 19:58:35,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:58:35,602 INFO L225 Difference]: With dead ends: 22 [2021-08-25 19:58:35,602 INFO L226 Difference]: Without dead ends: 18 [2021-08-25 19:58:35,603 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 32.8ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-08-25 19:58:35,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-08-25 19:58:35,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2021-08-25 19:58:35,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:35,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2021-08-25 19:58:35,605 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 12 [2021-08-25 19:58:35,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:58:35,605 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2021-08-25 19:58:35,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:35,605 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2021-08-25 19:58:35,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-25 19:58:35,606 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:58:35,606 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2021-08-25 19:58:35,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-25 19:58:35,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-08-25 19:58:35,824 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:58:35,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:58:35,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1268104729, now seen corresponding path program 3 times [2021-08-25 19:58:35,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:58:35,825 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302839452] [2021-08-25 19:58:35,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:58:35,825 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:58:35,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:58:35,880 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:58:35,880 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:58:35,880 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302839452] [2021-08-25 19:58:35,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302839452] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 19:58:35,881 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740922645] [2021-08-25 19:58:35,881 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-25 19:58:35,881 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 19:58:35,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 19:58:35,882 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 19:58:35,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-25 19:58:35,937 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-08-25 19:58:35,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 19:58:35,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-25 19:58:35,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:58:36,058 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:58:36,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740922645] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 19:58:36,059 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 19:58:36,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-08-25 19:58:36,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872858255] [2021-08-25 19:58:36,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-25 19:58:36,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:58:36,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-25 19:58:36,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-08-25 19:58:36,061 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:36,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:58:36,117 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2021-08-25 19:58:36,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-25 19:58:36,117 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-08-25 19:58:36,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:58:36,118 INFO L225 Difference]: With dead ends: 35 [2021-08-25 19:58:36,118 INFO L226 Difference]: Without dead ends: 31 [2021-08-25 19:58:36,118 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 42.1ms TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-08-25 19:58:36,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-08-25 19:58:36,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2021-08-25 19:58:36,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:36,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2021-08-25 19:58:36,121 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 15 [2021-08-25 19:58:36,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:58:36,121 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2021-08-25 19:58:36,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:36,122 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2021-08-25 19:58:36,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-25 19:58:36,122 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:58:36,122 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2021-08-25 19:58:36,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-25 19:58:36,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 19:58:36,339 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:58:36,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:58:36,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1171899538, now seen corresponding path program 4 times [2021-08-25 19:58:36,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:58:36,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390489386] [2021-08-25 19:58:36,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:58:36,345 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:58:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:58:36,406 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:58:36,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:58:36,406 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390489386] [2021-08-25 19:58:36,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390489386] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 19:58:36,407 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298578636] [2021-08-25 19:58:36,407 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-25 19:58:36,407 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 19:58:36,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 19:58:36,408 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 19:58:36,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-25 19:58:36,463 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-25 19:58:36,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 19:58:36,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-25 19:58:36,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:58:36,550 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:58:36,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298578636] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 19:58:36,550 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 19:58:36,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-08-25 19:58:36,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886294649] [2021-08-25 19:58:36,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-25 19:58:36,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:58:36,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-25 19:58:36,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-08-25 19:58:36,551 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:36,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:58:36,590 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2021-08-25 19:58:36,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-25 19:58:36,591 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-08-25 19:58:36,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:58:36,591 INFO L225 Difference]: With dead ends: 28 [2021-08-25 19:58:36,591 INFO L226 Difference]: Without dead ends: 24 [2021-08-25 19:58:36,592 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 41.5ms TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-08-25 19:58:36,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-08-25 19:58:36,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2021-08-25 19:58:36,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:36,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2021-08-25 19:58:36,594 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 18 [2021-08-25 19:58:36,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:58:36,594 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-08-25 19:58:36,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:36,595 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2021-08-25 19:58:36,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-25 19:58:36,595 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:58:36,595 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1] [2021-08-25 19:58:36,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-25 19:58:36,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 19:58:36,811 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:58:36,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:58:36,812 INFO L82 PathProgramCache]: Analyzing trace with hash -133759111, now seen corresponding path program 5 times [2021-08-25 19:58:36,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:58:36,812 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604711639] [2021-08-25 19:58:36,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:58:36,812 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:58:36,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:58:36,883 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:58:36,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:58:36,883 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604711639] [2021-08-25 19:58:36,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604711639] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 19:58:36,884 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095371172] [2021-08-25 19:58:36,884 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-25 19:58:36,884 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 19:58:36,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 19:58:36,909 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 19:58:36,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-25 19:58:37,000 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-08-25 19:58:37,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 19:58:37,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 18 conjunts are in the unsatisfiable core [2021-08-25 19:58:37,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:58:37,099 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:58:37,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095371172] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 19:58:37,100 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 19:58:37,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2021-08-25 19:58:37,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449260240] [2021-08-25 19:58:37,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-25 19:58:37,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:58:37,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-25 19:58:37,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-08-25 19:58:37,101 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:37,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:58:37,176 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2021-08-25 19:58:37,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-25 19:58:37,177 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-25 19:58:37,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:58:37,177 INFO L225 Difference]: With dead ends: 31 [2021-08-25 19:58:37,177 INFO L226 Difference]: Without dead ends: 27 [2021-08-25 19:58:37,178 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 60.5ms TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-08-25 19:58:37,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-08-25 19:58:37,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2021-08-25 19:58:37,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:37,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2021-08-25 19:58:37,181 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 21 [2021-08-25 19:58:37,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:58:37,181 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2021-08-25 19:58:37,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:37,182 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2021-08-25 19:58:37,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-25 19:58:37,182 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:58:37,183 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1] [2021-08-25 19:58:37,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-08-25 19:58:37,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 19:58:37,423 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:58:37,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:58:37,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1786738894, now seen corresponding path program 6 times [2021-08-25 19:58:37,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:58:37,424 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243022867] [2021-08-25 19:58:37,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:58:37,424 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:58:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:58:37,508 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:58:37,508 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:58:37,508 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243022867] [2021-08-25 19:58:37,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243022867] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 19:58:37,509 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241175787] [2021-08-25 19:58:37,509 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-25 19:58:37,509 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 19:58:37,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 19:58:37,525 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 19:58:37,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-08-25 19:58:37,656 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-08-25 19:58:37,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 19:58:37,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-25 19:58:37,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:58:37,801 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:58:37,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241175787] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 19:58:37,801 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 19:58:37,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-08-25 19:58:37,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622159127] [2021-08-25 19:58:37,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-25 19:58:37,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:58:37,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-25 19:58:37,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-08-25 19:58:37,803 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:37,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:58:37,868 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2021-08-25 19:58:37,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-25 19:58:37,869 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-08-25 19:58:37,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:58:37,869 INFO L225 Difference]: With dead ends: 34 [2021-08-25 19:58:37,869 INFO L226 Difference]: Without dead ends: 30 [2021-08-25 19:58:37,870 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 79.3ms TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-08-25 19:58:37,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-08-25 19:58:37,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2021-08-25 19:58:37,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:37,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2021-08-25 19:58:37,872 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 24 [2021-08-25 19:58:37,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:58:37,873 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2021-08-25 19:58:37,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:37,873 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2021-08-25 19:58:37,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-25 19:58:37,873 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:58:37,873 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1] [2021-08-25 19:58:37,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-08-25 19:58:38,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 19:58:38,090 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:58:38,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:58:38,090 INFO L82 PathProgramCache]: Analyzing trace with hash 387561689, now seen corresponding path program 7 times [2021-08-25 19:58:38,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:58:38,091 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410336897] [2021-08-25 19:58:38,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:58:38,091 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:58:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:58:38,177 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:58:38,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 19:58:38,178 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410336897] [2021-08-25 19:58:38,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410336897] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 19:58:38,178 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238770911] [2021-08-25 19:58:38,178 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-25 19:58:38,178 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 19:58:38,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 19:58:38,193 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-25 19:58:38,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-08-25 19:58:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:58:38,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 22 conjunts are in the unsatisfiable core [2021-08-25 19:58:38,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:58:38,436 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:58:38,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238770911] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 19:58:38,437 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 19:58:38,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-08-25 19:58:38,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179782937] [2021-08-25 19:58:38,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-08-25 19:58:38,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 19:58:38,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-08-25 19:58:38,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2021-08-25 19:58:38,438 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:38,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:58:38,518 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2021-08-25 19:58:38,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-25 19:58:38,518 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-08-25 19:58:38,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:58:38,519 INFO L225 Difference]: With dead ends: 37 [2021-08-25 19:58:38,519 INFO L226 Difference]: Without dead ends: 33 [2021-08-25 19:58:38,519 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 99.8ms TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2021-08-25 19:58:38,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-08-25 19:58:38,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2021-08-25 19:58:38,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:38,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2021-08-25 19:58:38,522 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 27 [2021-08-25 19:58:38,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:58:38,522 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2021-08-25 19:58:38,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:38,522 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2021-08-25 19:58:38,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-25 19:58:38,523 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:58:38,523 INFO L512 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2021-08-25 19:58:38,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-08-25 19:58:38,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 19:58:38,739 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:58:38,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:58:38,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1720528430, now seen corresponding path program 8 times [2021-08-25 19:58:38,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 19:58:38,740 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530426607] [2021-08-25 19:58:38,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:58:38,740 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 19:58:38,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 19:58:38,749 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-25 19:58:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 19:58:38,773 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-25 19:58:38,773 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-25 19:58:38,774 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 19:58:38,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-25 19:58:38,778 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 19:58:38,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 07:58:38 BoogieIcfgContainer [2021-08-25 19:58:38,795 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 19:58:38,795 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 19:58:38,795 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 19:58:38,795 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 19:58:38,796 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 07:58:34" (3/4) ... [2021-08-25 19:58:38,797 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-25 19:58:38,797 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 19:58:38,798 INFO L168 Benchmark]: Toolchain (without parser) took 4951.55 ms. Allocated memory was 50.3 MB in the beginning and 100.7 MB in the end (delta: 50.3 MB). Free memory was 28.1 MB in the beginning and 54.3 MB in the end (delta: -26.2 MB). Peak memory consumption was 23.5 MB. Max. memory is 16.1 GB. [2021-08-25 19:58:38,798 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 50.3 MB. Free memory was 32.0 MB in the beginning and 32.0 MB in the end (delta: 63.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 19:58:38,799 INFO L168 Benchmark]: CACSL2BoogieTranslator took 189.51 ms. Allocated memory was 50.3 MB in the beginning and 69.2 MB in the end (delta: 18.9 MB). Free memory was 27.9 MB in the beginning and 53.2 MB in the end (delta: -25.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. [2021-08-25 19:58:38,799 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.49 ms. Allocated memory is still 69.2 MB. Free memory was 53.2 MB in the beginning and 51.7 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 19:58:38,799 INFO L168 Benchmark]: Boogie Preprocessor took 19.48 ms. Allocated memory is still 69.2 MB. Free memory was 51.7 MB in the beginning and 50.7 MB in the end (delta: 978.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 19:58:38,799 INFO L168 Benchmark]: RCFGBuilder took 269.65 ms. Allocated memory is still 69.2 MB. Free memory was 50.7 MB in the beginning and 39.4 MB in the end (delta: 11.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-25 19:58:38,800 INFO L168 Benchmark]: TraceAbstraction took 4442.76 ms. Allocated memory was 69.2 MB in the beginning and 100.7 MB in the end (delta: 31.5 MB). Free memory was 38.9 MB in the beginning and 54.3 MB in the end (delta: -15.4 MB). Peak memory consumption was 18.1 MB. Max. memory is 16.1 GB. [2021-08-25 19:58:38,800 INFO L168 Benchmark]: Witness Printer took 2.26 ms. Allocated memory is still 100.7 MB. Free memory is still 54.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 19:58:38,801 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.09 ms. Allocated memory is still 50.3 MB. Free memory was 32.0 MB in the beginning and 32.0 MB in the end (delta: 63.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 189.51 ms. Allocated memory was 50.3 MB in the beginning and 69.2 MB in the end (delta: 18.9 MB). Free memory was 27.9 MB in the beginning and 53.2 MB in the end (delta: -25.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 20.49 ms. Allocated memory is still 69.2 MB. Free memory was 53.2 MB in the beginning and 51.7 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 19.48 ms. Allocated memory is still 69.2 MB. Free memory was 51.7 MB in the beginning and 50.7 MB in the end (delta: 978.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 269.65 ms. Allocated memory is still 69.2 MB. Free memory was 50.7 MB in the beginning and 39.4 MB in the end (delta: 11.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 4442.76 ms. Allocated memory was 69.2 MB in the beginning and 100.7 MB in the end (delta: 31.5 MB). Free memory was 38.9 MB in the beginning and 54.3 MB in the end (delta: -15.4 MB). Peak memory consumption was 18.1 MB. Max. memory is 16.1 GB. * Witness Printer took 2.26 ms. Allocated memory is still 100.7 MB. Free memory is still 54.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 8]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is 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) [L8] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4357.8ms, OverallIterations: 10, TraceHistogramMax: 8, EmptinessCheckTime: 8.8ms, AutomataDifference: 454.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 130 SDtfs, 132 SDslu, 623 SDs, 0 SdLazy, 645 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 283.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 173 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 386.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=9, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 28.8ms AutomataMinimizationTime, 9 MinimizatonAttempts, 26 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 47.2ms SsaConstructionTime, 246.2ms SatisfiabilityAnalysisTime, 1298.1ms InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 248 ConstructedInterpolants, 0 QuantifiedInterpolants, 1326 SizeOfPredicates, 9 NumberOfNonLiveVariables, 455 ConjunctsInSsa, 108 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 [2021-08-25 19:58:38,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-25 19:58:40,409 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 19:58:40,410 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 19:58:40,427 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 19:58:40,428 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 19:58:40,428 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 19:58:40,429 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 19:58:40,430 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 19:58:40,432 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 19:58:40,432 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 19:58:40,433 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 19:58:40,434 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 19:58:40,434 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 19:58:40,435 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 19:58:40,436 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 19:58:40,436 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 19:58:40,437 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 19:58:40,438 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 19:58:40,439 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 19:58:40,441 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 19:58:40,442 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 19:58:40,443 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 19:58:40,444 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 19:58:40,444 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 19:58:40,446 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 19:58:40,447 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 19:58:40,447 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 19:58:40,447 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 19:58:40,455 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 19:58:40,456 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 19:58:40,456 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 19:58:40,457 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 19:58:40,457 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 19:58:40,458 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 19:58:40,459 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 19:58:40,459 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 19:58:40,459 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 19:58:40,460 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 19:58:40,460 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 19:58:40,460 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 19:58:40,461 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 19:58:40,462 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-08-25 19:58:40,475 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 19:58:40,475 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 19:58:40,476 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 19:58:40,476 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 19:58:40,477 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 19:58:40,477 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 19:58:40,477 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 19:58:40,477 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 19:58:40,477 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 19:58:40,477 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 19:58:40,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 19:58:40,478 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 19:58:40,478 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 19:58:40,478 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 19:58:40,478 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-25 19:58:40,478 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-25 19:58:40,478 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 19:58:40,478 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 19:58:40,478 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 19:58:40,479 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 19:58:40,479 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 19:58:40,479 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 19:58:40,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 19:58:40,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 19:58:40,479 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 19:58:40,479 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 19:58:40,480 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 19:58:40,480 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-25 19:58:40,480 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-25 19:58:40,480 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 19:58:40,480 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 19:58:40,480 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-25 19:58:40,492 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 [2021-08-25 19:58:40,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 19:58:40,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 19:58:40,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 19:58:40,721 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 19:58:40,721 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 19:58:40,721 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/num_conversion_1.c [2021-08-25 19:58:40,763 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96d7daefc/93082d8fdfd548c891719cdc34ea8fbb/FLAGce17922da [2021-08-25 19:58:41,119 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 19:58:41,120 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_1.c [2021-08-25 19:58:41,124 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96d7daefc/93082d8fdfd548c891719cdc34ea8fbb/FLAGce17922da [2021-08-25 19:58:41,132 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96d7daefc/93082d8fdfd548c891719cdc34ea8fbb [2021-08-25 19:58:41,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 19:58:41,135 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 19:58:41,138 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 19:58:41,138 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 19:58:41,140 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 19:58:41,141 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 07:58:41" (1/1) ... [2021-08-25 19:58:41,141 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6668bedc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:58:41, skipping insertion in model container [2021-08-25 19:58:41,142 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 07:58:41" (1/1) ... [2021-08-25 19:58:41,148 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 19:58:41,156 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 19:58:41,277 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_1.c[368,381] [2021-08-25 19:58:41,292 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 19:58:41,302 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 19:58:41,310 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_1.c[368,381] [2021-08-25 19:58:41,316 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 19:58:41,360 INFO L208 MainTranslator]: Completed translation [2021-08-25 19:58:41,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:58:41 WrapperNode [2021-08-25 19:58:41,367 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 19:58:41,368 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 19:58:41,368 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 19:58:41,368 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 19:58:41,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:58:41" (1/1) ... [2021-08-25 19:58:41,379 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:58:41" (1/1) ... [2021-08-25 19:58:41,391 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 19:58:41,392 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 19:58:41,392 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 19:58:41,393 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 19:58:41,397 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:58:41" (1/1) ... [2021-08-25 19:58:41,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:58:41" (1/1) ... [2021-08-25 19:58:41,405 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:58:41" (1/1) ... [2021-08-25 19:58:41,405 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:58:41" (1/1) ... [2021-08-25 19:58:41,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:58:41" (1/1) ... [2021-08-25 19:58:41,418 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:58:41" (1/1) ... [2021-08-25 19:58:41,419 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:58:41" (1/1) ... [2021-08-25 19:58:41,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 19:58:41,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 19:58:41,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 19:58:41,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 19:58:41,422 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:58:41" (1/1) ... [2021-08-25 19:58:41,427 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 19:58:41,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 19:58:41,439 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-25 19:58:41,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-25 19:58:41,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 19:58:41,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 19:58:41,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-25 19:58:41,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 19:58:41,664 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 19:58:41,665 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-25 19:58:41,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 07:58:41 BoogieIcfgContainer [2021-08-25 19:58:41,666 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 19:58:41,667 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 19:58:41,667 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 19:58:41,669 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 19:58:41,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 07:58:41" (1/3) ... [2021-08-25 19:58:41,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c53ca26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 07:58:41, skipping insertion in model container [2021-08-25 19:58:41,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:58:41" (2/3) ... [2021-08-25 19:58:41,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c53ca26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 07:58:41, skipping insertion in model container [2021-08-25 19:58:41,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 07:58:41" (3/3) ... [2021-08-25 19:58:41,671 INFO L111 eAbstractionObserver]: Analyzing ICFG num_conversion_1.c [2021-08-25 19:58:41,674 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 19:58:41,674 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 19:58:41,698 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 19:58:41,702 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-25 19:58:41,702 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 19:58:41,709 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:41,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-08-25 19:58:41,712 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:58:41,712 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-08-25 19:58:41,713 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:58:41,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:58:41,716 INFO L82 PathProgramCache]: Analyzing trace with hash 889968487, now seen corresponding path program 1 times [2021-08-25 19:58:41,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:58:41,722 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349445964] [2021-08-25 19:58:41,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:58:41,723 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:58:41,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:58:41,725 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 19:58:41,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-25 19:58:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:58:41,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 1 conjunts are in the unsatisfiable core [2021-08-25 19:58:41,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:58:41,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:58:41,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:58:41,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:58:41,850 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:58:41,850 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349445964] [2021-08-25 19:58:41,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [349445964] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 19:58:41,851 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:58:41,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-25 19:58:41,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214152320] [2021-08-25 19:58:41,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-25 19:58:41,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:58:41,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-25 19:58:41,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-25 19:58:41,865 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:41,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:58:41,874 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2021-08-25 19:58:41,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-25 19:58:41,875 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-08-25 19:58:41,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:58:41,880 INFO L225 Difference]: With dead ends: 21 [2021-08-25 19:58:41,880 INFO L226 Difference]: Without dead ends: 9 [2021-08-25 19:58:41,881 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-25 19:58:41,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2021-08-25 19:58:41,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2021-08-25 19:58:41,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:41,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2021-08-25 19:58:41,899 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2021-08-25 19:58:41,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:58:41,900 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2021-08-25 19:58:41,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:41,900 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2021-08-25 19:58:41,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-08-25 19:58:41,901 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:58:41,901 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-08-25 19:58:41,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-08-25 19:58:42,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:58:42,108 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:58:42,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:58:42,109 INFO L82 PathProgramCache]: Analyzing trace with hash 889640786, now seen corresponding path program 1 times [2021-08-25 19:58:42,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:58:42,109 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1224039093] [2021-08-25 19:58:42,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:58:42,110 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:58:42,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:58:42,111 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 19:58:42,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-25 19:58:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:58:42,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 19:58:42,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:58:42,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:58:42,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:58:42,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:58:42,238 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:58:42,238 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1224039093] [2021-08-25 19:58:42,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1224039093] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 19:58:42,242 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:58:42,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-25 19:58:42,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031208686] [2021-08-25 19:58:42,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 19:58:42,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:58:42,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 19:58:42,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 19:58:42,261 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:42,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:58:42,292 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2021-08-25 19:58:42,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 19:58:42,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-08-25 19:58:42,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:58:42,293 INFO L225 Difference]: With dead ends: 17 [2021-08-25 19:58:42,293 INFO L226 Difference]: Without dead ends: 13 [2021-08-25 19:58:42,294 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 19:58:42,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-08-25 19:58:42,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-08-25 19:58:42,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:42,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2021-08-25 19:58:42,297 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 6 [2021-08-25 19:58:42,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:58:42,297 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-08-25 19:58:42,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:42,298 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2021-08-25 19:58:42,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-25 19:58:42,298 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:58:42,298 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-08-25 19:58:42,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-08-25 19:58:42,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:58:42,505 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:58:42,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:58:42,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1950053902, now seen corresponding path program 1 times [2021-08-25 19:58:42,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:58:42,507 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [20960799] [2021-08-25 19:58:42,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:58:42,507 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:58:42,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:58:42,508 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 19:58:42,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-25 19:58:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:58:42,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-25 19:58:42,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:58:42,655 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-25 19:58:42,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:58:42,731 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-25 19:58:42,732 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:58:42,732 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [20960799] [2021-08-25 19:58:42,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [20960799] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 19:58:42,732 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:58:42,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 19:58:42,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265189629] [2021-08-25 19:58:42,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 19:58:42,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:58:42,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 19:58:42,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 19:58:42,734 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:42,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:58:42,773 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2021-08-25 19:58:42,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 19:58:42,773 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-25 19:58:42,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:58:42,774 INFO L225 Difference]: With dead ends: 28 [2021-08-25 19:58:42,774 INFO L226 Difference]: Without dead ends: 19 [2021-08-25 19:58:42,774 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 40.8ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-25 19:58:42,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-08-25 19:58:42,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 13. [2021-08-25 19:58:42,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:42,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2021-08-25 19:58:42,777 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 12 [2021-08-25 19:58:42,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:58:42,777 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2021-08-25 19:58:42,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:42,778 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2021-08-25 19:58:42,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-25 19:58:42,778 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:58:42,778 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:58:42,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-08-25 19:58:42,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:58:42,985 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:58:42,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:58:42,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1664855024, now seen corresponding path program 1 times [2021-08-25 19:58:42,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:58:42,986 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905801729] [2021-08-25 19:58:42,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 19:58:42,987 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:58:42,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:58:42,987 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 19:58:42,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-08-25 19:58:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 19:58:43,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 19:58:43,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:58:43,134 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:58:43,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:58:43,223 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 19:58:43,224 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:58:43,224 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905801729] [2021-08-25 19:58:43,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905801729] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-25 19:58:43,225 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 19:58:43,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-08-25 19:58:43,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296709470] [2021-08-25 19:58:43,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-25 19:58:43,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:58:43,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-25 19:58:43,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 19:58:43,228 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:43,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:58:43,310 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2021-08-25 19:58:43,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-25 19:58:43,311 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-25 19:58:43,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:58:43,312 INFO L225 Difference]: With dead ends: 29 [2021-08-25 19:58:43,312 INFO L226 Difference]: Without dead ends: 25 [2021-08-25 19:58:43,313 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 74.8ms TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-08-25 19:58:43,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-08-25 19:58:43,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-08-25 19:58:43,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:43,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2021-08-25 19:58:43,322 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 12 [2021-08-25 19:58:43,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:58:43,322 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2021-08-25 19:58:43,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:43,323 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2021-08-25 19:58:43,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-25 19:58:43,324 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:58:43,325 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 19:58:43,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-08-25 19:58:43,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:58:43,531 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:58:43,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:58:43,532 INFO L82 PathProgramCache]: Analyzing trace with hash 2085526576, now seen corresponding path program 2 times [2021-08-25 19:58:43,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:58:43,533 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [989425779] [2021-08-25 19:58:43,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-25 19:58:43,533 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:58:43,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:58:43,534 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 19:58:43,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-08-25 19:58:43,627 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-25 19:58:43,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 19:58:43,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-25 19:58:43,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:58:43,756 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 29 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-08-25 19:58:43,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:58:43,857 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 29 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-08-25 19:58:43,858 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:58:43,858 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [989425779] [2021-08-25 19:58:43,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [989425779] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-25 19:58:43,858 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 19:58:43,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-08-25 19:58:43,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220619971] [2021-08-25 19:58:43,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-25 19:58:43,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:58:43,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-25 19:58:43,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-08-25 19:58:43,860 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:44,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:58:44,014 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2021-08-25 19:58:44,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-25 19:58:44,015 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-08-25 19:58:44,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:58:44,016 INFO L225 Difference]: With dead ends: 54 [2021-08-25 19:58:44,016 INFO L226 Difference]: Without dead ends: 39 [2021-08-25 19:58:44,016 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 132.0ms TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2021-08-25 19:58:44,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-08-25 19:58:44,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2021-08-25 19:58:44,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:44,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2021-08-25 19:58:44,019 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 24 [2021-08-25 19:58:44,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:58:44,020 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2021-08-25 19:58:44,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:44,020 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2021-08-25 19:58:44,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-25 19:58:44,020 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:58:44,020 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 1, 1, 1, 1, 1, 1] [2021-08-25 19:58:44,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-08-25 19:58:44,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:58:44,227 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:58:44,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:58:44,228 INFO L82 PathProgramCache]: Analyzing trace with hash -986835344, now seen corresponding path program 3 times [2021-08-25 19:58:44,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:58:44,228 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1542534299] [2021-08-25 19:58:44,228 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-25 19:58:44,229 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:58:44,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:58:44,232 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 19:58:44,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-08-25 19:58:44,298 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-08-25 19:58:44,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 19:58:44,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-25 19:58:44,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:58:44,468 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-08-25 19:58:44,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:58:44,735 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-08-25 19:58:44,735 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:58:44,735 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1542534299] [2021-08-25 19:58:44,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1542534299] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-25 19:58:44,735 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 19:58:44,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-08-25 19:58:44,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969452640] [2021-08-25 19:58:44,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-25 19:58:44,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:58:44,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-25 19:58:44,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-08-25 19:58:44,737 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:44,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:58:44,870 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2021-08-25 19:58:44,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-25 19:58:44,870 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-08-25 19:58:44,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:58:44,871 INFO L225 Difference]: With dead ends: 53 [2021-08-25 19:58:44,871 INFO L226 Difference]: Without dead ends: 31 [2021-08-25 19:58:44,871 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 181.4ms TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2021-08-25 19:58:44,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-08-25 19:58:44,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2021-08-25 19:58:44,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:44,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2021-08-25 19:58:44,875 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 24 [2021-08-25 19:58:44,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:58:44,875 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2021-08-25 19:58:44,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:44,875 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2021-08-25 19:58:44,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-25 19:58:44,876 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:58:44,876 INFO L512 BasicCegarLoop]: trace histogram [8, 8, 5, 3, 1, 1, 1, 1, 1, 1] [2021-08-25 19:58:44,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-08-25 19:58:45,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:58:45,082 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:58:45,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:58:45,082 INFO L82 PathProgramCache]: Analyzing trace with hash -29656432, now seen corresponding path program 4 times [2021-08-25 19:58:45,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:58:45,083 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1051991123] [2021-08-25 19:58:45,083 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-25 19:58:45,083 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:58:45,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:58:45,084 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 19:58:45,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-08-25 19:58:45,189 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-25 19:58:45,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 19:58:45,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-25 19:58:45,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:58:45,615 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-25 19:58:45,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:58:46,084 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-25 19:58:46,084 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:58:46,084 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1051991123] [2021-08-25 19:58:46,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1051991123] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-25 19:58:46,085 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 19:58:46,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2021-08-25 19:58:46,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304123457] [2021-08-25 19:58:46,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-08-25 19:58:46,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:58:46,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-08-25 19:58:46,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2021-08-25 19:58:46,086 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 28 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 28 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:46,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:58:46,695 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2021-08-25 19:58:46,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-25 19:58:46,696 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 28 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-08-25 19:58:46,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:58:46,696 INFO L225 Difference]: With dead ends: 53 [2021-08-25 19:58:46,696 INFO L226 Difference]: Without dead ends: 37 [2021-08-25 19:58:46,697 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 859.4ms TimeCoverageRelationStatistics Valid=152, Invalid=1108, Unknown=0, NotChecked=0, Total=1260 [2021-08-25 19:58:46,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-08-25 19:58:46,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-08-25 19:58:46,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:46,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2021-08-25 19:58:46,700 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 30 [2021-08-25 19:58:46,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:58:46,701 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2021-08-25 19:58:46,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 28 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:46,701 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2021-08-25 19:58:46,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-25 19:58:46,701 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 19:58:46,701 INFO L512 BasicCegarLoop]: trace histogram [10, 10, 6, 4, 1, 1, 1, 1, 1, 1] [2021-08-25 19:58:46,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-08-25 19:58:46,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:58:46,908 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 19:58:46,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 19:58:46,908 INFO L82 PathProgramCache]: Analyzing trace with hash -166593550, now seen corresponding path program 5 times [2021-08-25 19:58:46,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 19:58:46,909 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1606789663] [2021-08-25 19:58:46,909 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-25 19:58:46,909 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 19:58:46,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 19:58:46,910 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 19:58:46,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-08-25 19:58:47,033 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2021-08-25 19:58:47,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 19:58:47,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 17 conjunts are in the unsatisfiable core [2021-08-25 19:58:47,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 19:58:47,605 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-25 19:58:47,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 19:58:48,083 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-25 19:58:48,084 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 19:58:48,084 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1606789663] [2021-08-25 19:58:48,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1606789663] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 19:58:48,084 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 19:58:48,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18, 18] imperfect sequences [] total 34 [2021-08-25 19:58:48,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770263491] [2021-08-25 19:58:48,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-08-25 19:58:48,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 19:58:48,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-08-25 19:58:48,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=746, Unknown=0, NotChecked=0, Total=1122 [2021-08-25 19:58:48,085 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 34 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:48,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 19:58:48,179 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2021-08-25 19:58:48,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-25 19:58:48,180 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-08-25 19:58:48,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 19:58:48,180 INFO L225 Difference]: With dead ends: 39 [2021-08-25 19:58:48,180 INFO L226 Difference]: Without dead ends: 0 [2021-08-25 19:58:48,181 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 560.5ms TimeCoverageRelationStatistics Valid=376, Invalid=746, Unknown=0, NotChecked=0, Total=1122 [2021-08-25 19:58:48,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-25 19:58:48,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-25 19:58:48,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:48,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-25 19:58:48,181 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2021-08-25 19:58:48,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 19:58:48,181 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-25 19:58:48,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 19:58:48,182 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-25 19:58:48,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-25 19:58:48,183 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 19:58:48,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-08-25 19:58:48,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 19:58:48,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-25 19:58:48,389 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 19:58:48,446 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 19:58:48,446 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 19:58:48,942 INFO L860 garLoopResultBuilder]: At program point L33(lines 14 34) the Hoare annotation is: true [2021-08-25 19:58:48,942 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-25 19:58:48,942 INFO L853 garLoopResultBuilder]: At program point L23-2(lines 23 30) the Hoare annotation is: (let ((.cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ULTIMATE.start_main_~c~0) (_ bv1 32)))))) (let ((.cse6 ((_ zero_extend 24) ULTIMATE.start_main_~x~0)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse8 (_ bv1 32))))) (.cse7 ((_ zero_extend 24) ULTIMATE.start_main_~y~0))) (let ((.cse9 (= ULTIMATE.start_main_~y~0 (_ bv37 8))) (.cse10 (= .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse2))) .cse7))))) (.cse0 (= ULTIMATE.start_main_~y~0 (_ bv5 8))) (.cse1 (= ULTIMATE.start_main_~x~0 (_ bv37 8))) (.cse5 (= (_ bv1 8) ULTIMATE.start_main_~y~0))) (or (and .cse0 .cse1 (bvslt .cse2 (_ bv8 32)) (exists ((v_ULTIMATE.start_main_~c~0_50 (_ BitVec 8))) (let ((.cse4 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_50))) (let ((.cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse4 (_ bv1 32)))) (_ bv1 32)))))) (and (= ULTIMATE.start_main_~c~0 ((_ extract 7 0) (bvadd .cse3 (_ bv1 32)))) (bvslt .cse4 (_ bv8 32)) (bvslt .cse3 (_ bv8 32)))))) (= ULTIMATE.start_main_~bit~0 (_ bv4 8))) (and (= ULTIMATE.start_main_~y~0 (_ bv0 8)) .cse1 (= ULTIMATE.start_main_~c~0 (_ bv0 8))) (and (= (_ bv1 8) ULTIMATE.start_main_~bit~0) .cse1 (= (_ bv1 8) ULTIMATE.start_main_~c~0) .cse5) (and (= (_ bv0 32) ((_ zero_extend 24) ULTIMATE.start_main_~bit~0)) (= .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse8)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse2))))))))))))) .cse9 .cse10) (and .cse0 .cse1 (= (_ bv4 8) ULTIMATE.start_main_~c~0)) (and (exists ((v_ULTIMATE.start_main_~c~0_28 (_ BitVec 8))) (let ((.cse11 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_28))) (and (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv37 32) ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse11)))))) (_ bv0 32))) (= ULTIMATE.start_main_~c~0 ((_ extract 7 0) (bvadd .cse11 (_ bv1 32))))))) (exists ((v_ULTIMATE.start_main_~c~0_50 (_ BitVec 8))) (let ((.cse13 ((_ zero_extend 24) v_ULTIMATE.start_main_~c~0_50))) (let ((.cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse13 (_ bv1 32)))) (_ bv1 32)))) (_ bv1 32)))) (_ bv1 32)))) (_ bv1 32)))))) (and (= ULTIMATE.start_main_~c~0 ((_ extract 7 0) (bvadd .cse12 (_ bv1 32)))) (bvslt .cse12 (_ bv8 32)) (bvslt .cse13 (_ bv8 32)))))) .cse9 .cse10) (and .cse0 (= ULTIMATE.start_main_~c~0 (_ bv5 8)) .cse1) (and .cse1 (= (_ bv2 8) ULTIMATE.start_main_~c~0) .cse5))))) [2021-08-25 19:58:48,943 INFO L857 garLoopResultBuilder]: For program point L23-3(lines 23 30) no Hoare annotation was computed. [2021-08-25 19:58:48,943 INFO L857 garLoopResultBuilder]: For program point L7(lines 7 9) no Hoare annotation was computed. [2021-08-25 19:58:48,943 INFO L860 garLoopResultBuilder]: At program point L7-2(lines 6 11) the Hoare annotation is: true [2021-08-25 19:58:48,943 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-25 19:58:48,943 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-25 19:58:48,943 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-25 19:58:48,943 INFO L857 garLoopResultBuilder]: For program point L26(lines 26 28) no Hoare annotation was computed. [2021-08-25 19:58:48,943 INFO L857 garLoopResultBuilder]: For program point L26-2(lines 26 28) no Hoare annotation was computed. [2021-08-25 19:58:48,943 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2021-08-25 19:58:48,943 INFO L857 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2021-08-25 19:58:48,946 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 19:58:48,950 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2021-08-25 19:58:48,951 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2021-08-25 19:58:48,951 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2021-08-25 19:58:48,951 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_28,QUANTIFIED] [2021-08-25 19:58:48,951 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_28,QUANTIFIED] [2021-08-25 19:58:48,951 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2021-08-25 19:58:48,951 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2021-08-25 19:58:48,952 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2021-08-25 19:58:48,957 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2021-08-25 19:58:48,958 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2021-08-25 19:58:48,958 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2021-08-25 19:58:48,958 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_28,QUANTIFIED] [2021-08-25 19:58:48,958 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_28,QUANTIFIED] [2021-08-25 19:58:48,958 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2021-08-25 19:58:48,958 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2021-08-25 19:58:48,958 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2021-08-25 19:58:48,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 07:58:48 BoogieIcfgContainer [2021-08-25 19:58:48,960 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 19:58:48,969 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 19:58:48,970 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 19:58:48,970 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 19:58:48,970 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 07:58:41" (3/4) ... [2021-08-25 19:58:48,972 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-25 19:58:48,978 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-08-25 19:58:48,978 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-08-25 19:58:48,978 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-25 19:58:48,978 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-25 19:58:48,992 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((y == 5bv8 && x == 37bv8) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && (\exists v_ULTIMATE.start_main_~c~0_50 : bv8 :: (c == ~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] && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_50), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_50), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32))) && bit == 4bv8) || ((y == 0bv8 && x == 37bv8) && c == 0bv8)) || (((1bv8 == bit && x == 37bv8) && 1bv8 == c) && 1bv8 == y)) || (((0bv32 == ~zero_extendFrom8To32(bit) && ~zero_extendFrom8To32(x) == ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(y), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]))[7:0]))[7:0]), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0])) && y == 37bv8) && ~zero_extendFrom8To32(x) == ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), ~zero_extendFrom8To32(y))[7:0]))) || ((y == 5bv8 && x == 37bv8) && 4bv8 == c)) || ((((\exists v_ULTIMATE.start_main_~c~0_28 : bv8 :: !(~zero_extendFrom8To32(~bvand32(37bv32, ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_28))[7:0]))[7:0]) == 0bv32) && c == ~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_28), 1bv32)[7:0]) && (\exists v_ULTIMATE.start_main_~c~0_50 : bv8 :: (c == ~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] && ~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))) && y == 37bv8) && ~zero_extendFrom8To32(x) == ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), ~zero_extendFrom8To32(y))[7:0]))) || ((y == 5bv8 && c == 5bv8) && x == 37bv8)) || ((x == 37bv8 && 2bv8 == c) && 1bv8 == y) [2021-08-25 19:58:48,995 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-25 19:58:48,995 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 19:58:48,996 INFO L168 Benchmark]: Toolchain (without parser) took 7860.58 ms. Allocated memory was 83.9 MB in the beginning and 192.9 MB in the end (delta: 109.1 MB). Free memory was 60.8 MB in the beginning and 171.5 MB in the end (delta: -110.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 19:58:48,997 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 54.5 MB. Free memory was 35.4 MB in the beginning and 35.3 MB in the end (delta: 35.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 19:58:48,997 INFO L168 Benchmark]: CACSL2BoogieTranslator took 229.47 ms. Allocated memory is still 83.9 MB. Free memory was 60.7 MB in the beginning and 67.9 MB in the end (delta: -7.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-25 19:58:48,997 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.84 ms. Allocated memory is still 83.9 MB. Free memory was 67.9 MB in the beginning and 66.4 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 19:58:48,997 INFO L168 Benchmark]: Boogie Preprocessor took 28.37 ms. Allocated memory is still 83.9 MB. Free memory was 66.4 MB in the beginning and 65.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-25 19:58:48,997 INFO L168 Benchmark]: RCFGBuilder took 244.83 ms. Allocated memory is still 83.9 MB. Free memory was 65.2 MB in the beginning and 53.1 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-25 19:58:48,998 INFO L168 Benchmark]: TraceAbstraction took 7292.78 ms. Allocated memory was 83.9 MB in the beginning and 159.4 MB in the end (delta: 75.5 MB). Free memory was 52.7 MB in the beginning and 50.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 76.2 MB. Max. memory is 16.1 GB. [2021-08-25 19:58:48,998 INFO L168 Benchmark]: Witness Printer took 26.08 ms. Allocated memory is still 192.9 MB. Free memory was 173.6 MB in the beginning and 171.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-25 19:58:48,999 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.13 ms. Allocated memory is still 54.5 MB. Free memory was 35.4 MB in the beginning and 35.3 MB in the end (delta: 35.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 229.47 ms. Allocated memory is still 83.9 MB. Free memory was 60.7 MB in the beginning and 67.9 MB in the end (delta: -7.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 23.84 ms. Allocated memory is still 83.9 MB. Free memory was 67.9 MB in the beginning and 66.4 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 28.37 ms. Allocated memory is still 83.9 MB. Free memory was 66.4 MB in the beginning and 65.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 244.83 ms. Allocated memory is still 83.9 MB. Free memory was 65.2 MB in the beginning and 53.1 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 7292.78 ms. Allocated memory was 83.9 MB in the beginning and 159.4 MB in the end (delta: 75.5 MB). Free memory was 52.7 MB in the beginning and 50.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 76.2 MB. Max. memory is 16.1 GB. * Witness Printer took 26.08 ms. Allocated memory is still 192.9 MB. Free memory was 173.6 MB in the beginning and 171.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 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_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_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] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 8]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7248.5ms, OverallIterations: 8, TraceHistogramMax: 10, EmptinessCheckTime: 9.3ms, AutomataDifference: 1187.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 557.1ms, InitialAbstractionConstructionTime: 4.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 77 SDtfs, 149 SDslu, 286 SDs, 0 SdLazy, 677 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 405.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 310 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 1861.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=7, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 33.9ms AutomataMinimizationTime, 8 MinimizatonAttempts, 19 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 16 NumberOfFragments, 289 HoareAnnotationTreeSize, 3 FomulaSimplifications, 127 FormulaSimplificationTreeSizeReduction, 59.2ms HoareSimplificationTime, 3 FomulaSimplificationsInter, 630 FormulaSimplificationTreeSizeReductionInter, 492.9ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 58.2ms SsaConstructionTime, 108.0ms SatisfiabilityAnalysisTime, 3100.8ms InterpolantComputationTime, 150 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 284 ConstructedInterpolants, 39 QuantifiedInterpolants, 3243 SizeOfPredicates, 24 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant [2021-08-25 19:58:49,002 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2021-08-25 19:58:49,002 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2021-08-25 19:58:49,002 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2021-08-25 19:58:49,002 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_28,QUANTIFIED] [2021-08-25 19:58:49,003 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_28,QUANTIFIED] [2021-08-25 19:58:49,003 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2021-08-25 19:58:49,003 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2021-08-25 19:58:49,003 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2021-08-25 19:58:49,004 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2021-08-25 19:58:49,004 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2021-08-25 19:58:49,004 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2021-08-25 19:58:49,004 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_28,QUANTIFIED] [2021-08-25 19:58:49,004 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_28,QUANTIFIED] [2021-08-25 19:58:49,004 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2021-08-25 19:58:49,004 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] [2021-08-25 19:58:49,005 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0_50,QUANTIFIED] Derived loop invariant: ((((((((((y == 5bv8 && x == 37bv8) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && (\exists v_ULTIMATE.start_main_~c~0_50 : bv8 :: (c == ~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] && ~bvslt32(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_50), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_50), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32))) && bit == 4bv8) || ((y == 0bv8 && x == 37bv8) && c == 0bv8)) || (((1bv8 == bit && x == 37bv8) && 1bv8 == c) && 1bv8 == y)) || (((0bv32 == ~zero_extendFrom8To32(bit) && ~zero_extendFrom8To32(x) == ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(y), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]))[7:0]))[7:0]), ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]))[7:0]))[7:0])) && y == 37bv8) && ~zero_extendFrom8To32(x) == ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), ~zero_extendFrom8To32(y))[7:0]))) || ((y == 5bv8 && x == 37bv8) && 4bv8 == c)) || ((((\exists v_ULTIMATE.start_main_~c~0_28 : bv8 :: !(~zero_extendFrom8To32(~bvand32(37bv32, ~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_28))[7:0]))[7:0]) == 0bv32) && c == ~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0_28), 1bv32)[7:0]) && (\exists v_ULTIMATE.start_main_~c~0_50 : bv8 :: (c == ~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] && ~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))) && y == 37bv8) && ~zero_extendFrom8To32(x) == ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), ~zero_extendFrom8To32(y))[7:0]))) || ((y == 5bv8 && c == 5bv8) && x == 37bv8)) || ((x == 37bv8 && 2bv8 == c) && 1bv8 == y) - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-08-25 19:58:49,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...