./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/lcm1_valuebound2.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_valuebound2.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 d9f362f4d0f0336cfdd0e79a1ea9315dacff2e0b1a7a8f92f9aba0a2584524ed --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:35:09,132 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:35:09,134 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:35:09,153 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:35:09,154 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:35:09,156 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:35:09,157 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:35:09,159 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:35:09,160 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:35:09,163 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:35:09,164 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:35:09,165 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:35:09,165 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:35:09,167 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:35:09,168 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:35:09,169 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:35:09,169 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:35:09,170 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:35:09,172 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:35:09,176 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:35:09,177 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:35:09,178 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:35:09,179 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:35:09,179 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:35:09,183 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:35:09,184 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:35:09,184 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:35:09,185 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:35:09,185 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:35:09,185 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:35:09,186 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:35:09,187 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:35:09,188 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:35:09,188 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:35:09,189 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:35:09,189 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:35:09,189 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:35:09,190 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:35:09,190 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:35:09,190 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:35:09,191 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:35:09,191 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:09,220 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:35:09,220 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:35:09,221 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:35:09,221 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:35:09,221 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:35:09,221 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:35:09,222 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:35:09,222 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:35:09,222 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:35:09,222 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:35:09,230 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:35:09,230 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:35:09,230 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:35:09,230 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:35:09,231 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:35:09,231 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:35:09,231 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:35:09,231 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:35:09,231 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:35:09,231 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:35:09,231 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:35:09,232 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:35:09,232 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:35:09,232 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:35:09,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:35:09,232 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:35:09,232 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:35:09,234 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:35:09,234 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:35:09,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:35:09,234 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:35:09,234 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:35:09,234 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:35:09,235 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 -> d9f362f4d0f0336cfdd0e79a1ea9315dacff2e0b1a7a8f92f9aba0a2584524ed [2022-02-20 17:35:09,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:35:09,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:35:09,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:35:09,403 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:35:09,404 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:35:09,404 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/lcm1_valuebound2.c [2022-02-20 17:35:09,451 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2c44743f/01071406054c4f859100a304be821759/FLAGd15d9886e [2022-02-20 17:35:09,786 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:35:09,786 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/lcm1_valuebound2.c [2022-02-20 17:35:09,793 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2c44743f/01071406054c4f859100a304be821759/FLAGd15d9886e [2022-02-20 17:35:09,801 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2c44743f/01071406054c4f859100a304be821759 [2022-02-20 17:35:09,803 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:35:09,804 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:35:09,805 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:35:09,805 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:35:09,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:35:09,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:35:09" (1/1) ... [2022-02-20 17:35:09,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25075957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:35:09, skipping insertion in model container [2022-02-20 17:35:09,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:35:09" (1/1) ... [2022-02-20 17:35:09,812 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:35:09,820 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:35:09,927 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_valuebound2.c[552,565] [2022-02-20 17:35:09,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:35:09,944 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:35:09,955 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_valuebound2.c[552,565] [2022-02-20 17:35:09,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:35:09,972 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:35:09,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:35:09 WrapperNode [2022-02-20 17:35:09,972 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:35:09,973 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:35:09,974 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:35:09,974 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:35:09,978 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:09" (1/1) ... [2022-02-20 17:35:09,990 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:09" (1/1) ... [2022-02-20 17:35:10,007 INFO L137 Inliner]: procedures = 14, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 66 [2022-02-20 17:35:10,008 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:35:10,008 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:35:10,008 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:35:10,008 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:35:10,013 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:09" (1/1) ... [2022-02-20 17:35:10,013 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:09" (1/1) ... [2022-02-20 17:35:10,014 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:09" (1/1) ... [2022-02-20 17:35:10,014 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:09" (1/1) ... [2022-02-20 17:35:10,017 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:09" (1/1) ... [2022-02-20 17:35:10,019 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:09" (1/1) ... [2022-02-20 17:35:10,020 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:09" (1/1) ... [2022-02-20 17:35:10,022 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:35:10,023 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:35:10,023 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:35:10,023 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:35:10,024 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:35:09" (1/1) ... [2022-02-20 17:35:10,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:35:10,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:35:10,045 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:10,052 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:10,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:35:10,068 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:35:10,068 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:35:10,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:35:10,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:35:10,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:35:10,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:35:10,069 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:35:10,104 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:35:10,105 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:35:10,206 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:35:10,211 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:35:10,211 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 17:35:10,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:35:10 BoogieIcfgContainer [2022-02-20 17:35:10,212 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:35:10,213 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:35:10,213 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:35:10,223 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:35:10,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:35:09" (1/3) ... [2022-02-20 17:35:10,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13ab0d0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:35:10, skipping insertion in model container [2022-02-20 17:35:10,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:35:09" (2/3) ... [2022-02-20 17:35:10,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13ab0d0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:35:10, skipping insertion in model container [2022-02-20 17:35:10,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:35:10" (3/3) ... [2022-02-20 17:35:10,225 INFO L111 eAbstractionObserver]: Analyzing ICFG lcm1_valuebound2.c [2022-02-20 17:35:10,228 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:35:10,228 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:35:10,254 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:35:10,258 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:10,259 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:35:10,271 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:10,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 17:35:10,280 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:35:10,280 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:10,281 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:35:10,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:35:10,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1807347491, now seen corresponding path program 1 times [2022-02-20 17:35:10,297 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:35:10,298 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234965049] [2022-02-20 17:35:10,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:35:10,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:35:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:35:10,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:35:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:35:10,494 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-02-20 17:35:10,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-02-20 17:35:10,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID [2022-02-20 17:35:10,504 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#false} {38#true} #90#return; {39#false} is VALID [2022-02-20 17:35:10,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 17:35:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:35:10,534 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-02-20 17:35:10,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-02-20 17:35:10,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID [2022-02-20 17:35:10,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#false} {39#false} #92#return; {39#false} is VALID [2022-02-20 17:35:10,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 17:35:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:35:10,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-02-20 17:35:10,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-02-20 17:35:10,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID [2022-02-20 17:35:10,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#false} {39#false} #94#return; {39#false} is VALID [2022-02-20 17:35:10,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 17:35:10,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:35:10,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-02-20 17:35:10,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-02-20 17:35:10,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID [2022-02-20 17:35:10,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#false} {39#false} #96#return; {39#false} is VALID [2022-02-20 17:35:10,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 17:35:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:35:10,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-02-20 17:35:10,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-02-20 17:35:10,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID [2022-02-20 17:35:10,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#false} {39#false} #98#return; {39#false} is VALID [2022-02-20 17:35:10,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-02-20 17:35:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:35:10,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-02-20 17:35:10,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-02-20 17:35:10,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID [2022-02-20 17:35:10,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#false} {39#false} #100#return; {39#false} is VALID [2022-02-20 17:35:10,585 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:10,586 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:10,586 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 <= 2 then 1 else 0)); {38#true} is VALID [2022-02-20 17:35:10,586 INFO L290 TraceCheckUtils]: 3: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-02-20 17:35:10,586 INFO L290 TraceCheckUtils]: 4: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-02-20 17:35:10,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#false} assume true; {39#false} is VALID [2022-02-20 17:35:10,587 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {39#false} {38#true} #90#return; {39#false} is VALID [2022-02-20 17:35:10,587 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:10,589 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 <= 2 then 1 else 0)); {38#true} is VALID [2022-02-20 17:35:10,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-02-20 17:35:10,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-02-20 17:35:10,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {39#false} assume true; {39#false} is VALID [2022-02-20 17:35:10,590 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {39#false} {39#false} #92#return; {39#false} is VALID [2022-02-20 17:35:10,591 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:10,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-02-20 17:35:10,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-02-20 17:35:10,591 INFO L290 TraceCheckUtils]: 16: Hoare triple {39#false} assume true; {39#false} is VALID [2022-02-20 17:35:10,592 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {39#false} {39#false} #94#return; {39#false} is VALID [2022-02-20 17:35:10,592 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:10,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-02-20 17:35:10,593 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-02-20 17:35:10,593 INFO L290 TraceCheckUtils]: 21: Hoare triple {39#false} assume true; {39#false} is VALID [2022-02-20 17:35:10,593 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {39#false} {39#false} #96#return; {39#false} is VALID [2022-02-20 17:35:10,593 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:10,594 INFO L290 TraceCheckUtils]: 24: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-02-20 17:35:10,596 INFO L290 TraceCheckUtils]: 25: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-02-20 17:35:10,596 INFO L290 TraceCheckUtils]: 26: Hoare triple {39#false} assume true; {39#false} is VALID [2022-02-20 17:35:10,597 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {39#false} {39#false} #98#return; {39#false} is VALID [2022-02-20 17:35:10,597 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:10,597 INFO L290 TraceCheckUtils]: 29: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-02-20 17:35:10,597 INFO L290 TraceCheckUtils]: 30: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-02-20 17:35:10,598 INFO L290 TraceCheckUtils]: 31: Hoare triple {39#false} assume true; {39#false} is VALID [2022-02-20 17:35:10,598 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {39#false} {39#false} #100#return; {39#false} is VALID [2022-02-20 17:35:10,598 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:10,599 INFO L290 TraceCheckUtils]: 34: Hoare triple {39#false} assume false; {39#false} is VALID [2022-02-20 17:35:10,599 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:10,599 INFO L290 TraceCheckUtils]: 36: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2022-02-20 17:35:10,599 INFO L290 TraceCheckUtils]: 37: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2022-02-20 17:35:10,600 INFO L290 TraceCheckUtils]: 38: Hoare triple {39#false} assume !false; {39#false} is VALID [2022-02-20 17:35:10,600 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:10,601 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:35:10,602 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234965049] [2022-02-20 17:35:10,602 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234965049] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:35:10,603 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:35:10,603 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:35:10,605 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549457547] [2022-02-20 17:35:10,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:35:10,608 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:10,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:35:10,611 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:10,645 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:10,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:35:10,646 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:35:10,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:35:10,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:35:10,661 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:10,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:35:10,727 INFO L93 Difference]: Finished difference Result 67 states and 115 transitions. [2022-02-20 17:35:10,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:35:10,728 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:10,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:35:10,729 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:10,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 115 transitions. [2022-02-20 17:35:10,745 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:10,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 115 transitions. [2022-02-20 17:35:10,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 115 transitions. [2022-02-20 17:35:10,853 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:10,859 INFO L225 Difference]: With dead ends: 67 [2022-02-20 17:35:10,860 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 17:35:10,862 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:10,864 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:10,865 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:10,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 17:35:10,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-02-20 17:35:10,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:35:10,885 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:10,886 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:10,886 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:10,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:35:10,890 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2022-02-20 17:35:10,890 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2022-02-20 17:35:10,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:35:10,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:35:10,891 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:10,891 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:10,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:35:10,894 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2022-02-20 17:35:10,894 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2022-02-20 17:35:10,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:35:10,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:35:10,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:35:10,895 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:35:10,896 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:10,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2022-02-20 17:35:10,899 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 39 [2022-02-20 17:35:10,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:35:10,899 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2022-02-20 17:35:10,900 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:10,900 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2022-02-20 17:35:10,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 17:35:10,901 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:35:10,901 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:10,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:35:10,901 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:35:10,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:35:10,902 INFO L85 PathProgramCache]: Analyzing trace with hash 197197551, now seen corresponding path program 1 times [2022-02-20 17:35:10,902 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:35:10,903 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946635455] [2022-02-20 17:35:10,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:35:10,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:35:10,924 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:35:10,925 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1823205465] [2022-02-20 17:35:10,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:35:10,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:35:10,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:35:10,927 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:10,936 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:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:35:10,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:35:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:35:10,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:35:11,171 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:11,171 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:11,171 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 <= 2 then 1 else 0)); {272#true} is VALID [2022-02-20 17:35:11,171 INFO L290 TraceCheckUtils]: 3: Hoare triple {272#true} ~cond := #in~cond; {272#true} is VALID [2022-02-20 17:35:11,172 INFO L290 TraceCheckUtils]: 4: Hoare triple {272#true} assume !(0 == ~cond); {272#true} is VALID [2022-02-20 17:35:11,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {272#true} assume true; {272#true} is VALID [2022-02-20 17:35:11,172 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {272#true} {272#true} #90#return; {272#true} is VALID [2022-02-20 17:35:11,172 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:11,172 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 <= 2 then 1 else 0)); {272#true} is VALID [2022-02-20 17:35:11,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {272#true} ~cond := #in~cond; {272#true} is VALID [2022-02-20 17:35:11,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {272#true} assume !(0 == ~cond); {272#true} is VALID [2022-02-20 17:35:11,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {272#true} assume true; {272#true} is VALID [2022-02-20 17:35:11,173 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {272#true} {272#true} #92#return; {272#true} is VALID [2022-02-20 17:35:11,173 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:11,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {272#true} ~cond := #in~cond; {272#true} is VALID [2022-02-20 17:35:11,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {272#true} assume !(0 == ~cond); {272#true} is VALID [2022-02-20 17:35:11,174 INFO L290 TraceCheckUtils]: 16: Hoare triple {272#true} assume true; {272#true} is VALID [2022-02-20 17:35:11,174 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {272#true} {272#true} #94#return; {272#true} is VALID [2022-02-20 17:35:11,174 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:11,174 INFO L290 TraceCheckUtils]: 19: Hoare triple {272#true} ~cond := #in~cond; {272#true} is VALID [2022-02-20 17:35:11,174 INFO L290 TraceCheckUtils]: 20: Hoare triple {272#true} assume !(0 == ~cond); {272#true} is VALID [2022-02-20 17:35:11,175 INFO L290 TraceCheckUtils]: 21: Hoare triple {272#true} assume true; {272#true} is VALID [2022-02-20 17:35:11,175 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {272#true} {272#true} #96#return; {272#true} is VALID [2022-02-20 17:35:11,175 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:11,175 INFO L290 TraceCheckUtils]: 24: Hoare triple {272#true} ~cond := #in~cond; {272#true} is VALID [2022-02-20 17:35:11,175 INFO L290 TraceCheckUtils]: 25: Hoare triple {272#true} assume !(0 == ~cond); {272#true} is VALID [2022-02-20 17:35:11,175 INFO L290 TraceCheckUtils]: 26: Hoare triple {272#true} assume true; {272#true} is VALID [2022-02-20 17:35:11,176 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {272#true} {272#true} #98#return; {272#true} is VALID [2022-02-20 17:35:11,176 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:11,176 INFO L290 TraceCheckUtils]: 29: Hoare triple {272#true} ~cond := #in~cond; {272#true} is VALID [2022-02-20 17:35:11,176 INFO L290 TraceCheckUtils]: 30: Hoare triple {272#true} assume !(0 == ~cond); {272#true} is VALID [2022-02-20 17:35:11,176 INFO L290 TraceCheckUtils]: 31: Hoare triple {272#true} assume true; {272#true} is VALID [2022-02-20 17:35:11,176 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {272#true} {272#true} #100#return; {272#true} is VALID [2022-02-20 17:35:11,177 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:11,178 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:11,178 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:11,179 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:11,179 INFO L290 TraceCheckUtils]: 37: Hoare triple {387#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {273#false} is VALID [2022-02-20 17:35:11,180 INFO L290 TraceCheckUtils]: 38: Hoare triple {273#false} assume !false; {273#false} is VALID [2022-02-20 17:35:11,180 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:11,180 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:35:11,180 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:35:11,180 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946635455] [2022-02-20 17:35:11,181 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:35:11,181 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823205465] [2022-02-20 17:35:11,181 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823205465] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:35:11,181 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:35:11,181 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:35:11,182 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675274311] [2022-02-20 17:35:11,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:35:11,182 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:11,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:35:11,183 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:11,217 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:11,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:35:11,218 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:35:11,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:35:11,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:35:11,219 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:11,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:35:11,421 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2022-02-20 17:35:11,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:35:11,421 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:11,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:35:11,422 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:11,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-02-20 17:35:11,424 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:11,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-02-20 17:35:11,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-02-20 17:35:11,499 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:11,501 INFO L225 Difference]: With dead ends: 48 [2022-02-20 17:35:11,501 INFO L226 Difference]: Without dead ends: 46 [2022-02-20 17:35:11,502 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:11,504 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 11 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:35:11,504 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.0s Time] [2022-02-20 17:35:11,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-20 17:35:11,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2022-02-20 17:35:11,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:35:11,516 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:11,516 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:11,518 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:11,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:35:11,524 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2022-02-20 17:35:11,524 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2022-02-20 17:35:11,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:35:11,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:35:11,529 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:11,529 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:11,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:35:11,538 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2022-02-20 17:35:11,538 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2022-02-20 17:35:11,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:35:11,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:35:11,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:35:11,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:35:11,541 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:11,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2022-02-20 17:35:11,542 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 39 [2022-02-20 17:35:11,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:35:11,543 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2022-02-20 17:35:11,543 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:11,543 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2022-02-20 17:35:11,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 17:35:11,543 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:35:11,543 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:11,563 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:11,761 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:11,761 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:35:11,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:35:11,762 INFO L85 PathProgramCache]: Analyzing trace with hash -857401627, now seen corresponding path program 1 times [2022-02-20 17:35:11,762 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:35:11,762 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539572777] [2022-02-20 17:35:11,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:35:11,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:35:11,794 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:35:11,795 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [676007724] [2022-02-20 17:35:11,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:35:11,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:35:11,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:35:11,796 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:11,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process