./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/lcm1_valuebound10.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/nla-digbench-scaling/lcm1_valuebound10.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 460506a141aea77ccc3566603556d6eb3051804be1f001a5f66c36de73c2b800 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:35:02,095 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:35:02,097 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:35:02,142 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:35:02,143 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:35:02,146 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:35:02,147 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:35:02,150 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:35:02,151 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:35:02,156 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:35:02,156 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:35:02,158 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:35:02,158 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:35:02,160 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:35:02,161 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:35:02,164 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:35:02,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:35:02,165 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:35:02,167 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:35:02,172 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:35:02,173 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:35:02,174 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:35:02,176 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:35:02,176 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:35:02,182 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:35:02,182 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:35:02,183 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:35:02,184 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:35:02,185 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:35:02,185 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:35:02,185 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:35:02,186 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:35:02,188 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:35:02,188 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:35:02,189 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:35:02,190 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:35:02,190 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:35:02,190 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:35:02,190 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:35:02,191 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:35:02,192 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:35:02,192 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:35:02,218 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:35:02,219 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:35:02,219 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:35:02,219 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:35:02,220 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:35:02,220 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:35:02,221 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:35:02,221 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:35:02,221 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:35:02,221 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:35:02,222 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:35:02,222 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:35:02,223 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:35:02,223 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:35:02,223 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:35:02,223 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:35:02,223 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:35:02,223 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:35:02,224 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:35:02,224 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:35:02,224 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:35:02,224 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:35:02,224 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:35:02,224 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:35:02,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:35:02,226 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:35:02,226 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:35:02,226 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:35:02,226 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:35:02,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:35:02,227 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:35:02,227 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:35:02,227 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:35:02,227 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 -> 460506a141aea77ccc3566603556d6eb3051804be1f001a5f66c36de73c2b800 [2022-02-20 17:35:02,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:35:02,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:35:02,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:35:02,467 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:35:02,468 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:35:02,469 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/lcm1_valuebound10.c [2022-02-20 17:35:02,539 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7a384037/202c62eed1f342f6a04b12045fc60918/FLAGd71c8f1ea [2022-02-20 17:35:02,855 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:35:02,855 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/lcm1_valuebound10.c [2022-02-20 17:35:02,862 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7a384037/202c62eed1f342f6a04b12045fc60918/FLAGd71c8f1ea [2022-02-20 17:35:02,873 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7a384037/202c62eed1f342f6a04b12045fc60918 [2022-02-20 17:35:02,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:35:02,876 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:35:02,877 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:35:02,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:35:02,880 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:35:02,881 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:35:02" (1/1) ... [2022-02-20 17:35:02,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a93aa82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:35:02, skipping insertion in model container [2022-02-20 17:35:02,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:35:02" (1/1) ... [2022-02-20 17:35:02,888 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:35:02,899 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:35:03,031 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/lcm1_valuebound10.c[552,565] [2022-02-20 17:35:03,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:35:03,057 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:35:03,068 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/lcm1_valuebound10.c[552,565] [2022-02-20 17:35:03,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:35:03,086 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:35:03,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:35:03 WrapperNode [2022-02-20 17:35:03,087 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:35:03,088 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:35:03,088 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:35:03,088 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:35:03,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:35:03" (1/1) ... [2022-02-20 17:35:03,100 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:35:03" (1/1) ... [2022-02-20 17:35:03,121 INFO L137 Inliner]: procedures = 14, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 66 [2022-02-20 17:35:03,121 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:35:03,122 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:35:03,122 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:35:03,122 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:35:03,129 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:35:03" (1/1) ... [2022-02-20 17:35:03,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:35:03" (1/1) ... [2022-02-20 17:35:03,130 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:35:03" (1/1) ... [2022-02-20 17:35:03,131 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:35:03" (1/1) ... [2022-02-20 17:35:03,134 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:35:03" (1/1) ... [2022-02-20 17:35:03,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:35:03" (1/1) ... [2022-02-20 17:35:03,139 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:35:03" (1/1) ... [2022-02-20 17:35:03,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:35:03,141 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:35:03,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:35:03,141 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:35:03,142 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:35:03" (1/1) ... [2022-02-20 17:35:03,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:35:03,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:35:03,169 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) [2022-02-20 17:35:03,199 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 [2022-02-20 17:35:03,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:35:03,221 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:35:03,221 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:35:03,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:35:03,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:35:03,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:35:03,222 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:35:03,223 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:35:03,275 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:35:03,277 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:35:03,472 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:35:03,477 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:35:03,477 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 17:35:03,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:35:03 BoogieIcfgContainer [2022-02-20 17:35:03,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:35:03,497 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:35:03,497 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:35:03,503 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:35:03,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:35:02" (1/3) ... [2022-02-20 17:35:03,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676e876d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:35:03, skipping insertion in model container [2022-02-20 17:35:03,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:35:03" (2/3) ... [2022-02-20 17:35:03,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676e876d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:35:03, skipping insertion in model container [2022-02-20 17:35:03,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:35:03" (3/3) ... [2022-02-20 17:35:03,516 INFO L111 eAbstractionObserver]: Analyzing ICFG lcm1_valuebound10.c [2022-02-20 17:35:03,521 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:35:03,521 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:35:03,557 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:35:03,562 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, mAutomataTypeConcurrency=PETRI_NET, 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 [2022-02-20 17:35:03,562 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:35:03,579 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:35:03,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 17:35:03,584 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:35:03,584 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:35:03,585 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:35:03,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:35:03,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1807347491, now seen corresponding path program 1 times [2022-02-20 17:35:03,596 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:35:03,597 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307131792] [2022-02-20 17:35:03,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:35:03,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:35:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:35:03,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:35:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:35:03,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-02-20 17:35:03,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-02-20 17:35:03,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID [2022-02-20 17:35:03,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#false} {38#true} #90#return; {39#false} is VALID [2022-02-20 17:35:03,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 17:35:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:35:03,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-02-20 17:35:03,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-02-20 17:35:03,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID [2022-02-20 17:35:03,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#false} {39#false} #92#return; {39#false} is VALID [2022-02-20 17:35:03,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 17:35:03,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:35:03,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-02-20 17:35:03,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-02-20 17:35:03,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID [2022-02-20 17:35:03,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#false} {39#false} #94#return; {39#false} is VALID [2022-02-20 17:35:03,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 17:35:03,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:35:03,771 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-02-20 17:35:03,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-02-20 17:35:03,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID [2022-02-20 17:35:03,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#false} {39#false} #96#return; {39#false} is VALID [2022-02-20 17:35:03,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 17:35:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:35:03,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-02-20 17:35:03,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-02-20 17:35:03,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID [2022-02-20 17:35:03,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#false} {39#false} #98#return; {39#false} is VALID [2022-02-20 17:35:03,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-02-20 17:35:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:35:03,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-02-20 17:35:03,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-02-20 17:35:03,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID [2022-02-20 17:35:03,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#false} {39#false} #100#return; {39#false} is VALID [2022-02-20 17:35:03,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(108, 2, 0, 1);call write~init~int(99, 2, 1, 1);call write~init~int(109, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3); {38#true} is VALID [2022-02-20 17:35:03,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~a~0#1, main_~b~0#1, main_~x~0#1, main_~y~0#1, main_~u~0#1, main_~v~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~u~0#1;havoc main_~v~0#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {38#true} is VALID [2022-02-20 17:35:03,788 INFO L272 TraceCheckUtils]: 2: Hoare triple {38#true} call assume_abort_if_not((if main_~a~0#1 % 4294967296 >= 0 && main_~a~0#1 % 4294967296 <= 10 then 1 else 0)); {38#true} is VALID [2022-02-20 17:35:03,789 INFO L290 TraceCheckUtils]: 3: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-02-20 17:35:03,789 INFO L290 TraceCheckUtils]: 4: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-02-20 17:35:03,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#false} assume true; {39#false} is VALID [2022-02-20 17:35:03,790 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {39#false} {38#true} #90#return; {39#false} is VALID [2022-02-20 17:35:03,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#false} main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {39#false} is VALID [2022-02-20 17:35:03,790 INFO L272 TraceCheckUtils]: 8: Hoare triple {39#false} call assume_abort_if_not((if main_~b~0#1 % 4294967296 >= 0 && main_~b~0#1 % 4294967296 <= 10 then 1 else 0)); {38#true} is VALID [2022-02-20 17:35:03,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-02-20 17:35:03,791 INFO L290 TraceCheckUtils]: 10: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-02-20 17:35:03,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {39#false} assume true; {39#false} is VALID [2022-02-20 17:35:03,791 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {39#false} {39#false} #92#return; {39#false} is VALID [2022-02-20 17:35:03,792 INFO L272 TraceCheckUtils]: 13: Hoare triple {39#false} call assume_abort_if_not((if main_~a~0#1 % 4294967296 >= 1 then 1 else 0)); {38#true} is VALID [2022-02-20 17:35:03,792 INFO L290 TraceCheckUtils]: 14: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-02-20 17:35:03,792 INFO L290 TraceCheckUtils]: 15: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-02-20 17:35:03,793 INFO L290 TraceCheckUtils]: 16: Hoare triple {39#false} assume true; {39#false} is VALID [2022-02-20 17:35:03,793 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {39#false} {39#false} #94#return; {39#false} is VALID [2022-02-20 17:35:03,793 INFO L272 TraceCheckUtils]: 18: Hoare triple {39#false} call assume_abort_if_not((if main_~b~0#1 % 4294967296 >= 1 then 1 else 0)); {38#true} is VALID [2022-02-20 17:35:03,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-02-20 17:35:03,794 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-02-20 17:35:03,794 INFO L290 TraceCheckUtils]: 21: Hoare triple {39#false} assume true; {39#false} is VALID [2022-02-20 17:35:03,794 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {39#false} {39#false} #96#return; {39#false} is VALID [2022-02-20 17:35:03,795 INFO L272 TraceCheckUtils]: 23: Hoare triple {39#false} call assume_abort_if_not((if main_~a~0#1 % 4294967296 <= 65535 then 1 else 0)); {38#true} is VALID [2022-02-20 17:35:03,795 INFO L290 TraceCheckUtils]: 24: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-02-20 17:35:03,795 INFO L290 TraceCheckUtils]: 25: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-02-20 17:35:03,796 INFO L290 TraceCheckUtils]: 26: Hoare triple {39#false} assume true; {39#false} is VALID [2022-02-20 17:35:03,796 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {39#false} {39#false} #98#return; {39#false} is VALID [2022-02-20 17:35:03,796 INFO L272 TraceCheckUtils]: 28: Hoare triple {39#false} call assume_abort_if_not((if main_~b~0#1 % 4294967296 <= 65535 then 1 else 0)); {38#true} is VALID [2022-02-20 17:35:03,796 INFO L290 TraceCheckUtils]: 29: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-02-20 17:35:03,797 INFO L290 TraceCheckUtils]: 30: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-02-20 17:35:03,797 INFO L290 TraceCheckUtils]: 31: Hoare triple {39#false} assume true; {39#false} is VALID [2022-02-20 17:35:03,797 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {39#false} {39#false} #100#return; {39#false} is VALID [2022-02-20 17:35:03,798 INFO L290 TraceCheckUtils]: 33: Hoare triple {39#false} main_~x~0#1 := main_~a~0#1;main_~y~0#1 := main_~b~0#1;main_~u~0#1 := main_~b~0#1;main_~v~0#1 := 0; {39#false} is VALID [2022-02-20 17:35:03,798 INFO L290 TraceCheckUtils]: 34: Hoare triple {39#false} assume false; {39#false} is VALID [2022-02-20 17:35:03,798 INFO L272 TraceCheckUtils]: 35: Hoare triple {39#false} call __VERIFIER_assert((if (main_~u~0#1 * main_~y~0#1 + main_~v~0#1 * main_~y~0#1) % 4294967296 == main_~a~0#1 * main_~b~0#1 % 4294967296 then 1 else 0)); {39#false} is VALID [2022-02-20 17:35:03,798 INFO L290 TraceCheckUtils]: 36: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2022-02-20 17:35:03,798 INFO L290 TraceCheckUtils]: 37: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2022-02-20 17:35:03,799 INFO L290 TraceCheckUtils]: 38: Hoare triple {39#false} assume !false; {39#false} is VALID [2022-02-20 17:35:03,799 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-02-20 17:35:03,800 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:35:03,800 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307131792] [2022-02-20 17:35:03,801 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307131792] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:35:03,801 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:35:03,801 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:35:03,803 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705502179] [2022-02-20 17:35:03,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:35:03,807 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 39 [2022-02-20 17:35:03,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:35:03,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 17:35:03,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:35:03,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:35:03,840 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:35:03,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:35:03,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:35:03,859 INFO L87 Difference]: Start difference. First operand has 35 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 17:35:03,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:35:03,924 INFO L93 Difference]: Finished difference Result 67 states and 115 transitions. [2022-02-20 17:35:03,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:35:03,925 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 39 [2022-02-20 17:35:03,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:35:03,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 17:35:03,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 115 transitions. [2022-02-20 17:35:03,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 17:35:03,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 115 transitions. [2022-02-20 17:35:03,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 115 transitions. [2022-02-20 17:35:04,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:35:04,150 INFO L225 Difference]: With dead ends: 67 [2022-02-20 17:35:04,150 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 17:35:04,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:35:04,158 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:35:04,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:35:04,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 17:35:04,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-02-20 17:35:04,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:35:04,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:35:04,195 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:35:04,195 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:35:04,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:35:04,202 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2022-02-20 17:35:04,202 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2022-02-20 17:35:04,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:35:04,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:35:04,204 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 31 states. [2022-02-20 17:35:04,205 INFO L87 Difference]: Start difference. First operand has 31 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 31 states. [2022-02-20 17:35:04,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:35:04,208 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2022-02-20 17:35:04,208 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2022-02-20 17:35:04,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:35:04,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:35:04,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:35:04,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:35:04,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:35:04,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2022-02-20 17:35:04,220 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 39 [2022-02-20 17:35:04,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:35:04,221 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2022-02-20 17:35:04,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 17:35:04,222 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2022-02-20 17:35:04,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 17:35:04,224 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:35:04,224 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:35:04,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:35:04,225 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:35:04,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:35:04,226 INFO L85 PathProgramCache]: Analyzing trace with hash 197197551, now seen corresponding path program 1 times [2022-02-20 17:35:04,227 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:35:04,227 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117319484] [2022-02-20 17:35:04,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:35:04,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:35:04,275 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:35:04,275 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [343315576] [2022-02-20 17:35:04,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:35:04,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:35:04,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:35:04,283 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) [2022-02-20 17:35:04,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 17:35:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:35:04,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:35:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:35:04,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:35:04,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {272#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(108, 2, 0, 1);call write~init~int(99, 2, 1, 1);call write~init~int(109, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3); {272#true} is VALID [2022-02-20 17:35:04,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {272#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~a~0#1, main_~b~0#1, main_~x~0#1, main_~y~0#1, main_~u~0#1, main_~v~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~u~0#1;havoc main_~v~0#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {272#true} is VALID [2022-02-20 17:35:04,614 INFO L272 TraceCheckUtils]: 2: Hoare triple {272#true} call assume_abort_if_not((if main_~a~0#1 % 4294967296 >= 0 && main_~a~0#1 % 4294967296 <= 10 then 1 else 0)); {272#true} is VALID [2022-02-20 17:35:04,614 INFO L290 TraceCheckUtils]: 3: Hoare triple {272#true} ~cond := #in~cond; {272#true} is VALID [2022-02-20 17:35:04,614 INFO L290 TraceCheckUtils]: 4: Hoare triple {272#true} assume !(0 == ~cond); {272#true} is VALID [2022-02-20 17:35:04,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {272#true} assume true; {272#true} is VALID [2022-02-20 17:35:04,615 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {272#true} {272#true} #90#return; {272#true} is VALID [2022-02-20 17:35:04,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {272#true} main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {272#true} is VALID [2022-02-20 17:35:04,615 INFO L272 TraceCheckUtils]: 8: Hoare triple {272#true} call assume_abort_if_not((if main_~b~0#1 % 4294967296 >= 0 && main_~b~0#1 % 4294967296 <= 10 then 1 else 0)); {272#true} is VALID [2022-02-20 17:35:04,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {272#true} ~cond := #in~cond; {272#true} is VALID [2022-02-20 17:35:04,616 INFO L290 TraceCheckUtils]: 10: Hoare triple {272#true} assume !(0 == ~cond); {272#true} is VALID [2022-02-20 17:35:04,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {272#true} assume true; {272#true} is VALID [2022-02-20 17:35:04,616 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {272#true} {272#true} #92#return; {272#true} is VALID [2022-02-20 17:35:04,616 INFO L272 TraceCheckUtils]: 13: Hoare triple {272#true} call assume_abort_if_not((if main_~a~0#1 % 4294967296 >= 1 then 1 else 0)); {272#true} is VALID [2022-02-20 17:35:04,617 INFO L290 TraceCheckUtils]: 14: Hoare triple {272#true} ~cond := #in~cond; {272#true} is VALID [2022-02-20 17:35:04,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {272#true} assume !(0 == ~cond); {272#true} is VALID [2022-02-20 17:35:04,617 INFO L290 TraceCheckUtils]: 16: Hoare triple {272#true} assume true; {272#true} is VALID [2022-02-20 17:35:04,617 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {272#true} {272#true} #94#return; {272#true} is VALID [2022-02-20 17:35:04,618 INFO L272 TraceCheckUtils]: 18: Hoare triple {272#true} call assume_abort_if_not((if main_~b~0#1 % 4294967296 >= 1 then 1 else 0)); {272#true} is VALID [2022-02-20 17:35:04,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {272#true} ~cond := #in~cond; {272#true} is VALID [2022-02-20 17:35:04,618 INFO L290 TraceCheckUtils]: 20: Hoare triple {272#true} assume !(0 == ~cond); {272#true} is VALID [2022-02-20 17:35:04,618 INFO L290 TraceCheckUtils]: 21: Hoare triple {272#true} assume true; {272#true} is VALID [2022-02-20 17:35:04,618 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {272#true} {272#true} #96#return; {272#true} is VALID [2022-02-20 17:35:04,619 INFO L272 TraceCheckUtils]: 23: Hoare triple {272#true} call assume_abort_if_not((if main_~a~0#1 % 4294967296 <= 65535 then 1 else 0)); {272#true} is VALID [2022-02-20 17:35:04,619 INFO L290 TraceCheckUtils]: 24: Hoare triple {272#true} ~cond := #in~cond; {272#true} is VALID [2022-02-20 17:35:04,619 INFO L290 TraceCheckUtils]: 25: Hoare triple {272#true} assume !(0 == ~cond); {272#true} is VALID [2022-02-20 17:35:04,619 INFO L290 TraceCheckUtils]: 26: Hoare triple {272#true} assume true; {272#true} is VALID [2022-02-20 17:35:04,620 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {272#true} {272#true} #98#return; {272#true} is VALID [2022-02-20 17:35:04,620 INFO L272 TraceCheckUtils]: 28: Hoare triple {272#true} call assume_abort_if_not((if main_~b~0#1 % 4294967296 <= 65535 then 1 else 0)); {272#true} is VALID [2022-02-20 17:35:04,620 INFO L290 TraceCheckUtils]: 29: Hoare triple {272#true} ~cond := #in~cond; {272#true} is VALID [2022-02-20 17:35:04,620 INFO L290 TraceCheckUtils]: 30: Hoare triple {272#true} assume !(0 == ~cond); {272#true} is VALID [2022-02-20 17:35:04,620 INFO L290 TraceCheckUtils]: 31: Hoare triple {272#true} assume true; {272#true} is VALID [2022-02-20 17:35:04,621 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {272#true} {272#true} #100#return; {272#true} is VALID [2022-02-20 17:35:04,621 INFO L290 TraceCheckUtils]: 33: Hoare triple {272#true} main_~x~0#1 := main_~a~0#1;main_~y~0#1 := main_~b~0#1;main_~u~0#1 := main_~b~0#1;main_~v~0#1 := 0; {376#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~u~0#1|) (= |ULTIMATE.start_main_~v~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:35:04,622 INFO L290 TraceCheckUtils]: 34: Hoare triple {376#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~u~0#1|) (= |ULTIMATE.start_main_~v~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} assume !false; {376#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~u~0#1|) (= |ULTIMATE.start_main_~v~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:35:04,623 INFO L272 TraceCheckUtils]: 35: Hoare triple {376#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~u~0#1|) (= |ULTIMATE.start_main_~v~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} call __VERIFIER_assert((if (main_~x~0#1 * main_~u~0#1 + main_~y~0#1 * main_~v~0#1) % 4294967296 == main_~a~0#1 * main_~b~0#1 % 4294967296 then 1 else 0)); {383#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:35:04,624 INFO L290 TraceCheckUtils]: 36: Hoare triple {383#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {387#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:35:04,624 INFO L290 TraceCheckUtils]: 37: Hoare triple {387#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {273#false} is VALID [2022-02-20 17:35:04,624 INFO L290 TraceCheckUtils]: 38: Hoare triple {273#false} assume !false; {273#false} is VALID [2022-02-20 17:35:04,625 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-02-20 17:35:04,625 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:35:04,625 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:35:04,625 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117319484] [2022-02-20 17:35:04,626 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:35:04,626 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343315576] [2022-02-20 17:35:04,626 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343315576] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:35:04,626 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:35:04,627 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:35:04,627 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070763074] [2022-02-20 17:35:04,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:35:04,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 39 [2022-02-20 17:35:04,629 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:35:04,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 17:35:04,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:35:04,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:35:04,656 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:35:04,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:35:04,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:35:04,661 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 17:35:06,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:35:06,469 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2022-02-20 17:35:06,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:35:06,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 39 [2022-02-20 17:35:06,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:35:06,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 17:35:06,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-02-20 17:35:06,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 17:35:06,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-02-20 17:35:06,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-02-20 17:35:06,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:35:06,553 INFO L225 Difference]: With dead ends: 48 [2022-02-20 17:35:06,553 INFO L226 Difference]: Without dead ends: 46 [2022-02-20 17:35:06,554 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:35:06,555 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 11 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:35:06,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 131 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:35:06,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-20 17:35:06,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2022-02-20 17:35:06,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:35:06,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 44 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:35:06,564 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 44 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:35:06,564 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 44 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:35:06,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:35:06,568 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2022-02-20 17:35:06,568 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2022-02-20 17:35:06,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:35:06,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:35:06,570 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 46 states. [2022-02-20 17:35:06,570 INFO L87 Difference]: Start difference. First operand has 44 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 46 states. [2022-02-20 17:35:06,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:35:06,573 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2022-02-20 17:35:06,574 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2022-02-20 17:35:06,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:35:06,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:35:06,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:35:06,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:35:06,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:35:06,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2022-02-20 17:35:06,578 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 39 [2022-02-20 17:35:06,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:35:06,579 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2022-02-20 17:35:06,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 17:35:06,579 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2022-02-20 17:35:06,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 17:35:06,581 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:35:06,581 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:35:06,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:35:06,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:35:06,796 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:35:06,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:35:06,796 INFO L85 PathProgramCache]: Analyzing trace with hash -857401627, now seen corresponding path program 1 times [2022-02-20 17:35:06,796 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:35:06,797 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661918277] [2022-02-20 17:35:06,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:35:06,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:35:06,818 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:35:06,819 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [316070072] [2022-02-20 17:35:06,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:35:06,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:35:06,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:35:06,820 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) [2022-02-20 17:35:06,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process