./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 574ddb4e Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound5.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 34f640e37bae156029b1a359a4abe58394472212f3f36aea9107706542ec544a --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-18 19:10:50,135 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 19:10:50,136 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 19:10:50,164 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 19:10:50,164 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 19:10:50,166 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 19:10:50,168 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 19:10:50,170 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 19:10:50,172 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 19:10:50,175 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 19:10:50,176 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 19:10:50,177 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 19:10:50,177 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 19:10:50,179 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 19:10:50,180 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 19:10:50,181 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 19:10:50,181 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 19:10:50,182 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 19:10:50,183 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 19:10:50,186 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 19:10:50,187 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 19:10:50,188 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 19:10:50,188 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 19:10:50,189 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 19:10:50,194 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 19:10:50,195 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 19:10:50,195 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 19:10:50,196 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 19:10:50,196 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 19:10:50,197 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 19:10:50,197 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 19:10:50,197 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 19:10:50,198 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 19:10:50,199 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 19:10:50,200 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 19:10:50,200 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 19:10:50,201 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 19:10:50,201 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 19:10:50,201 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 19:10:50,201 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 19:10:50,202 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 19:10:50,203 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-18 19:10:50,229 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 19:10:50,229 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 19:10:50,230 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 19:10:50,230 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 19:10:50,231 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 19:10:50,231 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 19:10:50,231 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 19:10:50,231 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 19:10:50,231 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 19:10:50,232 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 19:10:50,232 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 19:10:50,232 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 19:10:50,232 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 19:10:50,232 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 19:10:50,233 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 19:10:50,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 19:10:50,233 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 19:10:50,233 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 19:10:50,233 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 19:10:50,233 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 19:10:50,233 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 19:10:50,234 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 19:10:50,234 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 19:10:50,234 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 19:10:50,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 19:10:50,234 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 19:10:50,234 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 19:10:50,234 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 19:10:50,235 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 19:10:50,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 19:10:50,235 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 19:10:50,235 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 19:10:50,235 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 19:10:50,235 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 19:10:50,235 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 19:10:50,236 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 34f640e37bae156029b1a359a4abe58394472212f3f36aea9107706542ec544a [2023-02-18 19:10:50,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 19:10:50,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 19:10:50,450 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 19:10:50,451 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 19:10:50,451 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 19:10:50,452 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound5.c [2023-02-18 19:10:51,317 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 19:10:51,468 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 19:10:51,468 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound5.c [2023-02-18 19:10:51,472 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c50737ab/ea84617124084603a18739cf78e58388/FLAGb08bf90c3 [2023-02-18 19:10:51,481 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c50737ab/ea84617124084603a18739cf78e58388 [2023-02-18 19:10:51,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 19:10:51,485 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 19:10:51,486 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 19:10:51,486 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 19:10:51,489 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 19:10:51,489 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 07:10:51" (1/1) ... [2023-02-18 19:10:51,490 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3036b545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:10:51, skipping insertion in model container [2023-02-18 19:10:51,490 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 07:10:51" (1/1) ... [2023-02-18 19:10:51,494 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 19:10:51,502 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 19:10:51,580 WARN L237 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/prodbin-ll_valuebound5.c[537,550] [2023-02-18 19:10:51,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 19:10:51,593 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 19:10:51,600 WARN L237 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/prodbin-ll_valuebound5.c[537,550] [2023-02-18 19:10:51,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 19:10:51,610 INFO L208 MainTranslator]: Completed translation [2023-02-18 19:10:51,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:10:51 WrapperNode [2023-02-18 19:10:51,611 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 19:10:51,611 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 19:10:51,612 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 19:10:51,612 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 19:10:51,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:10:51" (1/1) ... [2023-02-18 19:10:51,620 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:10:51" (1/1) ... [2023-02-18 19:10:51,629 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2023-02-18 19:10:51,630 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 19:10:51,630 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 19:10:51,630 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 19:10:51,630 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 19:10:51,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:10:51" (1/1) ... [2023-02-18 19:10:51,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:10:51" (1/1) ... [2023-02-18 19:10:51,636 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:10:51" (1/1) ... [2023-02-18 19:10:51,636 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:10:51" (1/1) ... [2023-02-18 19:10:51,638 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:10:51" (1/1) ... [2023-02-18 19:10:51,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:10:51" (1/1) ... [2023-02-18 19:10:51,640 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:10:51" (1/1) ... [2023-02-18 19:10:51,641 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:10:51" (1/1) ... [2023-02-18 19:10:51,642 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 19:10:51,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 19:10:51,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 19:10:51,642 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 19:10:51,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:10:51" (1/1) ... [2023-02-18 19:10:51,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 19:10:51,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:10:51,669 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) [2023-02-18 19:10:51,687 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 [2023-02-18 19:10:51,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 19:10:51,698 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-18 19:10:51,698 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-18 19:10:51,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 19:10:51,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 19:10:51,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 19:10:51,699 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 19:10:51,700 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 19:10:51,741 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 19:10:51,743 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 19:10:51,866 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 19:10:51,870 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 19:10:51,870 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-18 19:10:51,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:10:51 BoogieIcfgContainer [2023-02-18 19:10:51,872 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 19:10:51,881 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 19:10:51,881 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 19:10:51,883 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 19:10:51,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 07:10:51" (1/3) ... [2023-02-18 19:10:51,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3715bdb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 07:10:51, skipping insertion in model container [2023-02-18 19:10:51,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:10:51" (2/3) ... [2023-02-18 19:10:51,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3715bdb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 07:10:51, skipping insertion in model container [2023-02-18 19:10:51,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:10:51" (3/3) ... [2023-02-18 19:10:51,886 INFO L112 eAbstractionObserver]: Analyzing ICFG prodbin-ll_valuebound5.c [2023-02-18 19:10:51,908 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 19:10:51,908 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 19:10:51,963 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 19:10:51,973 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@375a7cd4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 19:10:51,974 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 19:10:51,976 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-18 19:10:51,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-18 19:10:51,981 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:10:51,981 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:10:51,982 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:10:51,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:10:51,985 INFO L85 PathProgramCache]: Analyzing trace with hash -861605892, now seen corresponding path program 1 times [2023-02-18 19:10:51,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:10:51,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96597608] [2023-02-18 19:10:51,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:10:51,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:10:52,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:10:52,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:10:52,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96597608] [2023-02-18 19:10:52,091 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-18 19:10:52,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258562465] [2023-02-18 19:10:52,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:10:52,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:10:52,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:10:52,094 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) [2023-02-18 19:10:52,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-18 19:10:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:10:52,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-18 19:10:52,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:10:52,171 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-18 19:10:52,172 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 19:10:52,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258562465] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 19:10:52,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 19:10:52,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 19:10:52,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931656785] [2023-02-18 19:10:52,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 19:10:52,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 19:10:52,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:10:52,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 19:10:52,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 19:10:52,210 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-18 19:10:52,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:10:52,229 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2023-02-18 19:10:52,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 19:10:52,231 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2023-02-18 19:10:52,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:10:52,235 INFO L225 Difference]: With dead ends: 51 [2023-02-18 19:10:52,235 INFO L226 Difference]: Without dead ends: 23 [2023-02-18 19:10:52,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 19:10:52,243 INFO L413 NwaCegarLoop]: 31 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, 31 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 [2023-02-18 19:10:52,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 19:10:52,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-18 19:10:52,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-18 19:10:52,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 19:10:52,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-02-18 19:10:52,269 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 24 [2023-02-18 19:10:52,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:10:52,269 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-02-18 19:10:52,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-18 19:10:52,270 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-02-18 19:10:52,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-18 19:10:52,271 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:10:52,272 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:10:52,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-18 19:10:52,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-02-18 19:10:52,479 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:10:52,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:10:52,480 INFO L85 PathProgramCache]: Analyzing trace with hash -2010313222, now seen corresponding path program 1 times [2023-02-18 19:10:52,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:10:52,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772499875] [2023-02-18 19:10:52,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:10:52,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:10:52,498 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 19:10:52,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2067538441] [2023-02-18 19:10:52,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:10:52,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:10:52,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:10:52,502 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) [2023-02-18 19:10:52,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-18 19:10:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:10:52,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 19:10:52,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:10:52,594 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 19:10:52,595 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 19:10:52,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:10:52,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772499875] [2023-02-18 19:10:52,595 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 19:10:52,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067538441] [2023-02-18 19:10:52,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067538441] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 19:10:52,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 19:10:52,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-18 19:10:52,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067168330] [2023-02-18 19:10:52,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 19:10:52,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 19:10:52,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:10:52,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 19:10:52,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-18 19:10:52,598 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 19:10:52,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:10:52,697 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2023-02-18 19:10:52,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 19:10:52,698 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2023-02-18 19:10:52,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:10:52,699 INFO L225 Difference]: With dead ends: 39 [2023-02-18 19:10:52,699 INFO L226 Difference]: Without dead ends: 32 [2023-02-18 19:10:52,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-02-18 19:10:52,701 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 16 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 19:10:52,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 81 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 19:10:52,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-18 19:10:52,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2023-02-18 19:10:52,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-18 19:10:52,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2023-02-18 19:10:52,708 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 24 [2023-02-18 19:10:52,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:10:52,708 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2023-02-18 19:10:52,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 19:10:52,709 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2023-02-18 19:10:52,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-18 19:10:52,709 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:10:52,709 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:10:52,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-18 19:10:52,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-02-18 19:10:52,910 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:10:52,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:10:52,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1371702355, now seen corresponding path program 1 times [2023-02-18 19:10:52,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:10:52,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820141288] [2023-02-18 19:10:52,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:10:52,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:10:52,925 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 19:10:52,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1644848515] [2023-02-18 19:10:52,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:10:52,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:10:52,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:10:52,930 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 19:10:52,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-18 19:10:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:10:52,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-18 19:10:52,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:10:53,095 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 19:10:53,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:10:53,865 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 19:10:53,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:10:53,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820141288] [2023-02-18 19:10:53,866 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 19:10:53,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644848515] [2023-02-18 19:10:53,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644848515] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 19:10:53,866 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 19:10:53,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 18 [2023-02-18 19:10:53,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139519632] [2023-02-18 19:10:53,867 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 19:10:53,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-18 19:10:53,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:10:53,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-18 19:10:53,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2023-02-18 19:10:53,869 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 16 states have internal predecessors, (31), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-02-18 19:10:54,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:10:54,470 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2023-02-18 19:10:54,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-18 19:10:54,471 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 16 states have internal predecessors, (31), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 33 [2023-02-18 19:10:54,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:10:54,472 INFO L225 Difference]: With dead ends: 48 [2023-02-18 19:10:54,472 INFO L226 Difference]: Without dead ends: 46 [2023-02-18 19:10:54,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2023-02-18 19:10:54,474 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 34 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 19:10:54,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 95 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-18 19:10:54,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-02-18 19:10:54,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2023-02-18 19:10:54,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 19:10:54,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2023-02-18 19:10:54,481 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 33 [2023-02-18 19:10:54,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:10:54,481 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2023-02-18 19:10:54,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 16 states have internal predecessors, (31), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-02-18 19:10:54,481 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2023-02-18 19:10:54,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-18 19:10:54,482 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:10:54,482 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:10:54,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-18 19:10:54,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:10:54,687 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:10:54,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:10:54,687 INFO L85 PathProgramCache]: Analyzing trace with hash 685673296, now seen corresponding path program 1 times [2023-02-18 19:10:54,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:10:54,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619435441] [2023-02-18 19:10:54,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:10:54,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:10:54,697 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 19:10:54,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1792268036] [2023-02-18 19:10:54,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:10:54,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:10:54,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:10:54,702 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 19:10:54,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-18 19:10:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:10:54,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-18 19:10:54,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:10:54,795 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-18 19:10:54,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:10:55,313 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-18 19:10:55,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:10:55,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619435441] [2023-02-18 19:10:55,314 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 19:10:55,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792268036] [2023-02-18 19:10:55,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792268036] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 19:10:55,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 19:10:55,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-18 19:10:55,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337786961] [2023-02-18 19:10:55,314 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 19:10:55,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 19:10:55,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:10:55,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 19:10:55,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=98, Unknown=1, NotChecked=0, Total=132 [2023-02-18 19:10:55,316 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 12 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2023-02-18 19:10:55,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:10:55,382 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2023-02-18 19:10:55,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 19:10:55,383 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 39 [2023-02-18 19:10:55,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:10:55,384 INFO L225 Difference]: With dead ends: 50 [2023-02-18 19:10:55,384 INFO L226 Difference]: Without dead ends: 43 [2023-02-18 19:10:55,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=133, Unknown=1, NotChecked=0, Total=182 [2023-02-18 19:10:55,385 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 16 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 19:10:55,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 114 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 19:10:55,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-02-18 19:10:55,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2023-02-18 19:10:55,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 19:10:55,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2023-02-18 19:10:55,390 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 39 [2023-02-18 19:10:55,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:10:55,391 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2023-02-18 19:10:55,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2023-02-18 19:10:55,391 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2023-02-18 19:10:55,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-18 19:10:55,392 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:10:55,392 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:10:55,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-18 19:10:55,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:10:55,596 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:10:55,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:10:55,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1683883622, now seen corresponding path program 1 times [2023-02-18 19:10:55,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:10:55,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199861542] [2023-02-18 19:10:55,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:10:55,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:10:55,606 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 19:10:55,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1849046390] [2023-02-18 19:10:55,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:10:55,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:10:55,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:10:55,615 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 19:10:55,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-18 19:10:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:10:55,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-18 19:10:55,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:10:57,081 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-18 19:10:57,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:11:32,752 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-18 19:11:32,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:11:32,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199861542] [2023-02-18 19:11:32,752 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 19:11:32,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849046390] [2023-02-18 19:11:32,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849046390] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 19:11:32,753 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 19:11:32,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2023-02-18 19:11:32,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219613998] [2023-02-18 19:11:32,753 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 19:11:32,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-18 19:11:32,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:11:32,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-18 19:11:32,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2023-02-18 19:11:32,754 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 24 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 21 states have internal predecessors, (41), 7 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-18 19:11:36,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-02-18 19:11:39,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 19:11:45,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 19:11:48,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-02-18 19:11:50,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 19:11:56,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 19:11:58,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 19:12:04,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-02-18 19:12:06,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 19:12:07,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 19:12:18,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-02-18 19:12:19,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-02-18 19:12:21,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-02-18 19:12:23,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 19:12:30,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-02-18 19:12:32,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 19:12:34,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 19:12:40,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 19:12:42,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:12:42,569 INFO L93 Difference]: Finished difference Result 92 states and 111 transitions. [2023-02-18 19:12:42,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-18 19:12:42,569 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 21 states have internal predecessors, (41), 7 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) Word has length 42 [2023-02-18 19:12:42,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:12:42,571 INFO L225 Difference]: With dead ends: 92 [2023-02-18 19:12:42,571 INFO L226 Difference]: Without dead ends: 90 [2023-02-18 19:12:42,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 55.4s TimeCoverageRelationStatistics Valid=241, Invalid=1090, Unknown=1, NotChecked=0, Total=1332 [2023-02-18 19:12:42,572 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 54 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 45 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.3s IncrementalHoareTripleChecker+Time [2023-02-18 19:12:42,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 102 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 316 Invalid, 5 Unknown, 0 Unchecked, 40.3s Time] [2023-02-18 19:12:42,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-02-18 19:12:42,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-02-18 19:12:42,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 66 states have (on average 1.1363636363636365) internal successors, (75), 72 states have internal predecessors, (75), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 11 states have call predecessors, (17), 17 states have call successors, (17) [2023-02-18 19:12:42,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2023-02-18 19:12:42,587 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 42 [2023-02-18 19:12:42,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:12:42,588 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2023-02-18 19:12:42,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 21 states have internal predecessors, (41), 7 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-18 19:12:42,588 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2023-02-18 19:12:42,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-18 19:12:42,590 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:12:42,590 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:12:42,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-18 19:12:42,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:12:42,790 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:12:42,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:12:42,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1217167219, now seen corresponding path program 1 times [2023-02-18 19:12:42,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:12:42,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003708212] [2023-02-18 19:12:42,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:12:42,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:12:42,802 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 19:12:42,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1160217203] [2023-02-18 19:12:42,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:12:42,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:12:42,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:12:42,804 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 19:12:42,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-18 19:12:42,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:12:42,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-18 19:12:42,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:12:42,980 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 19:12:42,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:12:44,267 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 19:12:44,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:12:44,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003708212] [2023-02-18 19:12:44,267 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 19:12:44,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160217203] [2023-02-18 19:12:44,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160217203] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 19:12:44,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 19:12:44,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2023-02-18 19:12:44,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751506023] [2023-02-18 19:12:44,268 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 19:12:44,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-18 19:12:44,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:12:44,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-18 19:12:44,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2023-02-18 19:12:44,270 INFO L87 Difference]: Start difference. First operand 90 states and 109 transitions. Second operand has 21 states, 19 states have (on average 2.263157894736842) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2023-02-18 19:12:44,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:12:44,563 INFO L93 Difference]: Finished difference Result 132 states and 159 transitions. [2023-02-18 19:12:44,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 19:12:44,563 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.263157894736842) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) Word has length 51 [2023-02-18 19:12:44,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:12:44,564 INFO L225 Difference]: With dead ends: 132 [2023-02-18 19:12:44,564 INFO L226 Difference]: Without dead ends: 68 [2023-02-18 19:12:44,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=619, Unknown=0, NotChecked=0, Total=812 [2023-02-18 19:12:44,566 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 20 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 19:12:44,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 147 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 19:12:44,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-02-18 19:12:44,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-02-18 19:12:44,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-18 19:12:44,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2023-02-18 19:12:44,574 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 51 [2023-02-18 19:12:44,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:12:44,575 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2023-02-18 19:12:44,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.263157894736842) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2023-02-18 19:12:44,575 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2023-02-18 19:12:44,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-02-18 19:12:44,576 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:12:44,576 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:12:44,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-18 19:12:44,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:12:44,781 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:12:44,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:12:44,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1335126818, now seen corresponding path program 2 times [2023-02-18 19:12:44,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:12:44,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514966534] [2023-02-18 19:12:44,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:12:44,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:12:44,789 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 19:12:44,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [47522537] [2023-02-18 19:12:44,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 19:12:44,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:12:44,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:12:44,791 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 19:12:44,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-18 19:12:44,836 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 19:12:44,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 19:12:44,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-18 19:12:44,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:14:23,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:14:23,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514966534] [2023-02-18 19:14:23,163 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 19:14:23,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47522537] [2023-02-18 19:14:23,163 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2023-02-18 19:14:23,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-18 19:14:23,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:14:23,365 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Probably an infinite loop! at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtils.preprocessDualFiniteJunction(QuantifierPushUtils.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:323) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:345) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:345) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:345) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:345) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:345) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:345) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:345) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-02-18 19:14:23,369 INFO L158 Benchmark]: Toolchain (without parser) took 211884.17ms. Allocated memory was 132.1MB in the beginning and 453.0MB in the end (delta: 320.9MB). Free memory was 98.2MB in the beginning and 163.9MB in the end (delta: -65.7MB). Peak memory consumption was 269.6MB. Max. memory is 16.1GB. [2023-02-18 19:14:23,369 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 132.1MB. Free memory is still 103.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 19:14:23,370 INFO L158 Benchmark]: CACSL2BoogieTranslator took 125.06ms. Allocated memory is still 132.1MB. Free memory was 97.9MB in the beginning and 87.8MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 19:14:23,370 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.32ms. Allocated memory is still 132.1MB. Free memory was 87.5MB in the beginning and 86.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 19:14:23,370 INFO L158 Benchmark]: Boogie Preprocessor took 11.57ms. Allocated memory is still 132.1MB. Free memory was 86.2MB in the beginning and 85.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 19:14:23,370 INFO L158 Benchmark]: RCFGBuilder took 229.48ms. Allocated memory is still 132.1MB. Free memory was 85.0MB in the beginning and 74.9MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 19:14:23,371 INFO L158 Benchmark]: TraceAbstraction took 211488.03ms. Allocated memory was 132.1MB in the beginning and 453.0MB in the end (delta: 320.9MB). Free memory was 74.4MB in the beginning and 163.9MB in the end (delta: -89.5MB). Peak memory consumption was 246.5MB. Max. memory is 16.1GB. [2023-02-18 19:14:23,372 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 132.1MB. Free memory is still 103.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 125.06ms. Allocated memory is still 132.1MB. Free memory was 97.9MB in the beginning and 87.8MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.32ms. Allocated memory is still 132.1MB. Free memory was 87.5MB in the beginning and 86.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 11.57ms. Allocated memory is still 132.1MB. Free memory was 86.2MB in the beginning and 85.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 229.48ms. Allocated memory is still 132.1MB. Free memory was 85.0MB in the beginning and 74.9MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 211488.03ms. Allocated memory was 132.1MB in the beginning and 453.0MB in the end (delta: 320.9MB). Free memory was 74.4MB in the beginning and 163.9MB in the end (delta: -89.5MB). Peak memory consumption was 246.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Probably an infinite loop! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Probably an infinite loop!: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtils.preprocessDualFiniteJunction(QuantifierPushUtils.java:124) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-02-18 19:14:23,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 34f640e37bae156029b1a359a4abe58394472212f3f36aea9107706542ec544a --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-18 19:14:24,977 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 19:14:24,979 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 19:14:25,012 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 19:14:25,013 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 19:14:25,015 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 19:14:25,017 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 19:14:25,019 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 19:14:25,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 19:14:25,025 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 19:14:25,026 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 19:14:25,027 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 19:14:25,028 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 19:14:25,029 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 19:14:25,030 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 19:14:25,032 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 19:14:25,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 19:14:25,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 19:14:25,035 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 19:14:25,038 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 19:14:25,039 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 19:14:25,040 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 19:14:25,040 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 19:14:25,041 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 19:14:25,046 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 19:14:25,046 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 19:14:25,046 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 19:14:25,047 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 19:14:25,047 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 19:14:25,048 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 19:14:25,049 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 19:14:25,052 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 19:14:25,054 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 19:14:25,054 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 19:14:25,055 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 19:14:25,055 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 19:14:25,055 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 19:14:25,055 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 19:14:25,055 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 19:14:25,056 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 19:14:25,056 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 19:14:25,057 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-02-18 19:14:25,081 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 19:14:25,081 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 19:14:25,082 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 19:14:25,082 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 19:14:25,083 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 19:14:25,083 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 19:14:25,083 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 19:14:25,083 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 19:14:25,083 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 19:14:25,084 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 19:14:25,084 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 19:14:25,084 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 19:14:25,084 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 19:14:25,085 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 19:14:25,085 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 19:14:25,085 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 19:14:25,085 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-18 19:14:25,085 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-18 19:14:25,085 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-18 19:14:25,086 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 19:14:25,086 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 19:14:25,086 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 19:14:25,086 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 19:14:25,086 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 19:14:25,086 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 19:14:25,086 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 19:14:25,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 19:14:25,087 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 19:14:25,087 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 19:14:25,087 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 19:14:25,087 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-18 19:14:25,087 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-18 19:14:25,088 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 19:14:25,088 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 19:14:25,088 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 19:14:25,088 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 19:14:25,088 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-18 19:14:25,088 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 19:14:25,088 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 34f640e37bae156029b1a359a4abe58394472212f3f36aea9107706542ec544a [2023-02-18 19:14:25,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 19:14:25,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 19:14:25,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 19:14:25,337 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 19:14:25,337 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 19:14:25,338 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound5.c [2023-02-18 19:14:26,329 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 19:14:26,507 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 19:14:26,508 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound5.c [2023-02-18 19:14:26,512 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/594e96a74/e6c1a7b56cb8424084b3932add15641f/FLAGce6fee2b4 [2023-02-18 19:14:26,523 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/594e96a74/e6c1a7b56cb8424084b3932add15641f [2023-02-18 19:14:26,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 19:14:26,526 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 19:14:26,527 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 19:14:26,527 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 19:14:26,529 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 19:14:26,529 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 07:14:26" (1/1) ... [2023-02-18 19:14:26,530 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c84454f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:14:26, skipping insertion in model container [2023-02-18 19:14:26,530 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 07:14:26" (1/1) ... [2023-02-18 19:14:26,535 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 19:14:26,545 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 19:14:26,625 WARN L237 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/prodbin-ll_valuebound5.c[537,550] [2023-02-18 19:14:26,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 19:14:26,641 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 19:14:26,649 WARN L237 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/prodbin-ll_valuebound5.c[537,550] [2023-02-18 19:14:26,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 19:14:26,661 INFO L208 MainTranslator]: Completed translation [2023-02-18 19:14:26,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:14:26 WrapperNode [2023-02-18 19:14:26,661 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 19:14:26,662 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 19:14:26,662 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 19:14:26,662 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 19:14:26,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:14:26" (1/1) ... [2023-02-18 19:14:26,672 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:14:26" (1/1) ... [2023-02-18 19:14:26,681 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 40 [2023-02-18 19:14:26,682 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 19:14:26,682 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 19:14:26,682 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 19:14:26,683 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 19:14:26,687 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:14:26" (1/1) ... [2023-02-18 19:14:26,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:14:26" (1/1) ... [2023-02-18 19:14:26,689 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:14:26" (1/1) ... [2023-02-18 19:14:26,689 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:14:26" (1/1) ... [2023-02-18 19:14:26,692 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:14:26" (1/1) ... [2023-02-18 19:14:26,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:14:26" (1/1) ... [2023-02-18 19:14:26,695 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:14:26" (1/1) ... [2023-02-18 19:14:26,695 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:14:26" (1/1) ... [2023-02-18 19:14:26,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 19:14:26,697 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 19:14:26,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 19:14:26,697 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 19:14:26,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:14:26" (1/1) ... [2023-02-18 19:14:26,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 19:14:26,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:14:26,719 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) [2023-02-18 19:14:26,730 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 [2023-02-18 19:14:26,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 19:14:26,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-18 19:14:26,753 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-18 19:14:26,753 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-18 19:14:26,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 19:14:26,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 19:14:26,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 19:14:26,754 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 19:14:26,803 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 19:14:26,805 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 19:14:27,047 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 19:14:27,051 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 19:14:27,051 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-18 19:14:27,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:14:27 BoogieIcfgContainer [2023-02-18 19:14:27,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 19:14:27,053 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 19:14:27,053 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 19:14:27,055 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 19:14:27,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 07:14:26" (1/3) ... [2023-02-18 19:14:27,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7141d0a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 07:14:27, skipping insertion in model container [2023-02-18 19:14:27,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:14:26" (2/3) ... [2023-02-18 19:14:27,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7141d0a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 07:14:27, skipping insertion in model container [2023-02-18 19:14:27,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:14:27" (3/3) ... [2023-02-18 19:14:27,064 INFO L112 eAbstractionObserver]: Analyzing ICFG prodbin-ll_valuebound5.c [2023-02-18 19:14:27,074 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 19:14:27,074 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 19:14:27,157 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 19:14:27,161 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@642b774c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 19:14:27,161 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 19:14:27,164 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-18 19:14:27,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-18 19:14:27,169 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:14:27,169 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:14:27,169 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:14:27,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:14:27,172 INFO L85 PathProgramCache]: Analyzing trace with hash -861605892, now seen corresponding path program 1 times [2023-02-18 19:14:27,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 19:14:27,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1412521512] [2023-02-18 19:14:27,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:14:27,180 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 19:14:27,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 19:14:27,182 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 19:14:27,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-18 19:14:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:14:27,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-18 19:14:27,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:14:27,291 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 19:14:27,292 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 19:14:27,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 19:14:27,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1412521512] [2023-02-18 19:14:27,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1412521512] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 19:14:27,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 19:14:27,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 19:14:27,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4302096] [2023-02-18 19:14:27,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 19:14:27,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 19:14:27,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 19:14:27,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 19:14:27,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 19:14:27,314 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-18 19:14:27,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:14:27,327 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2023-02-18 19:14:27,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 19:14:27,328 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2023-02-18 19:14:27,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:14:27,332 INFO L225 Difference]: With dead ends: 51 [2023-02-18 19:14:27,332 INFO L226 Difference]: Without dead ends: 23 [2023-02-18 19:14:27,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 19:14:27,339 INFO L413 NwaCegarLoop]: 31 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, 31 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 [2023-02-18 19:14:27,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 19:14:27,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-18 19:14:27,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-18 19:14:27,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 19:14:27,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-02-18 19:14:27,360 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 24 [2023-02-18 19:14:27,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:14:27,360 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-02-18 19:14:27,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-18 19:14:27,361 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-02-18 19:14:27,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-18 19:14:27,362 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:14:27,362 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:14:27,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-18 19:14:27,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 19:14:27,575 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:14:27,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:14:27,576 INFO L85 PathProgramCache]: Analyzing trace with hash -2010313222, now seen corresponding path program 1 times [2023-02-18 19:14:27,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 19:14:27,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [653550942] [2023-02-18 19:14:27,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:14:27,577 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 19:14:27,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 19:14:27,578 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 19:14:27,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-18 19:14:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:14:27,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-18 19:14:27,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:14:27,810 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 19:14:27,811 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 19:14:27,811 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 19:14:27,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [653550942] [2023-02-18 19:14:27,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [653550942] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 19:14:27,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 19:14:27,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-18 19:14:27,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490985523] [2023-02-18 19:14:27,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 19:14:27,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 19:14:27,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 19:14:27,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 19:14:27,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-02-18 19:14:27,829 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 states have internal predecessors, (11), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 19:14:28,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:14:28,365 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2023-02-18 19:14:28,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 19:14:28,365 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 states have internal predecessors, (11), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 24 [2023-02-18 19:14:28,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:14:28,366 INFO L225 Difference]: With dead ends: 39 [2023-02-18 19:14:28,366 INFO L226 Difference]: Without dead ends: 32 [2023-02-18 19:14:28,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-02-18 19:14:28,367 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 18 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 19:14:28,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 79 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-18 19:14:28,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-18 19:14:28,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2023-02-18 19:14:28,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-18 19:14:28,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2023-02-18 19:14:28,373 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 24 [2023-02-18 19:14:28,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:14:28,374 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2023-02-18 19:14:28,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 states have internal predecessors, (11), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 19:14:28,374 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2023-02-18 19:14:28,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-18 19:14:28,375 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:14:28,375 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:14:28,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-18 19:14:28,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 19:14:28,581 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:14:28,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:14:28,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1371702355, now seen corresponding path program 1 times [2023-02-18 19:14:28,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 19:14:28,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1566948889] [2023-02-18 19:14:28,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:14:28,583 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 19:14:28,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 19:14:28,584 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 19:14:28,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-18 19:14:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:14:28,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 19:14:28,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:14:30,479 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 19:14:30,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:14:52,772 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|))) (or (let ((.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|))) (= (bvadd (bvadd (_ bv0 64) .cse0) (bvmul (bvmul (_ bv2 64) .cse0) (bvsdiv (bvadd .cse1 (_ bv18446744073709551615 64)) (_ bv2 64)))) (bvmul .cse0 .cse1))) (not (= (_ bv1 64) (bvsrem .cse1 (_ bv2 64)))))) is different from true [2023-02-18 19:15:01,424 WARN L859 $PredicateComparison]: unable to prove that (and (or (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_8| (_ BitVec 32))) (let ((.cse1 ((_ sign_extend 32) |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_8|))) (or (let ((.cse0 ((_ sign_extend 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_10|))) (= (bvadd (bvadd (_ bv0 64) .cse0) (bvmul (bvmul (_ bv2 64) .cse0) (bvsdiv (bvadd .cse1 (_ bv18446744073709551615 64)) (_ bv2 64)))) (bvmul .cse0 .cse1))) (bvsle |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_8| (_ bv5 32)) (not (= (_ bv1 64) (bvsrem .cse1 (_ bv2 64)))))))) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_8| (_ BitVec 32))) (let ((.cse3 ((_ sign_extend 32) |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_8|))) (or (let ((.cse2 ((_ sign_extend 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_10|))) (= (bvadd (bvadd (_ bv0 64) .cse2) (bvmul (bvmul (_ bv2 64) .cse2) (bvsdiv (bvadd .cse3 (_ bv18446744073709551615 64)) (_ bv2 64)))) (bvmul .cse2 .cse3))) (not (bvsle |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_8| (_ bv5 32))) (not (= (_ bv1 64) (bvsrem .cse3 (_ bv2 64)))) (not (bvsge |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_8| (_ bv0 32)))))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv1 32))))) is different from true [2023-02-18 19:15:11,632 WARN L859 $PredicateComparison]: unable to prove that (or (and (or (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_8| (_ BitVec 32))) (let ((.cse1 ((_ sign_extend 32) |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_8|))) (or (let ((.cse0 ((_ sign_extend 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_10|))) (= (bvadd (bvadd (_ bv0 64) .cse0) (bvmul (bvmul (_ bv2 64) .cse0) (bvsdiv (bvadd .cse1 (_ bv18446744073709551615 64)) (_ bv2 64)))) (bvmul .cse0 .cse1))) (bvsle |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_8| (_ bv5 32)) (not (= (_ bv1 64) (bvsrem .cse1 (_ bv2 64)))))))) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_8| (_ BitVec 32))) (let ((.cse3 ((_ sign_extend 32) |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_8|))) (or (let ((.cse2 ((_ sign_extend 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_10|))) (= (bvadd (bvadd (_ bv0 64) .cse2) (bvmul (bvmul (_ bv2 64) .cse2) (bvsdiv (bvadd .cse3 (_ bv18446744073709551615 64)) (_ bv2 64)))) (bvmul .cse2 .cse3))) (not (bvsle |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_8| (_ bv5 32))) (not (= (_ bv1 64) (bvsrem .cse3 (_ bv2 64)))) (not (bvsge |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_8| (_ bv0 32)))))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv1 32))))) (= (_ bv0 32) c_assume_abort_if_not_~cond)) is different from true [2023-02-18 19:15:16,413 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 5 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 19:15:16,414 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 19:15:16,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1566948889] [2023-02-18 19:15:16,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1566948889] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 19:15:16,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 19:15:16,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2023-02-18 19:15:16,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276593806] [2023-02-18 19:15:16,414 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 19:15:16,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-18 19:15:16,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 19:15:16,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-18 19:15:16,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=196, Unknown=5, NotChecked=90, Total=342 [2023-02-18 19:15:16,422 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 15 states have internal predecessors, (33), 8 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-18 19:15:28,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-02-18 19:15:30,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-02-18 19:15:32,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-02-18 19:15:35,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-02-18 19:15:37,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-02-18 19:15:39,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-02-18 19:15:43,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-02-18 19:15:48,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-02-18 19:15:52,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-02-18 19:15:54,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-02-18 19:15:56,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-02-18 19:15:58,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-02-18 19:16:19,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:16:39,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:16:58,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:17:01,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:17:13,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:17:16,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:17:19,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:17:21,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:17:23,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:17:25,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:17:35,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:17:38,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:17:38,628 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2023-02-18 19:17:38,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-18 19:17:38,646 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 15 states have internal predecessors, (33), 8 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 33 [2023-02-18 19:17:38,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:17:38,646 INFO L225 Difference]: With dead ends: 57 [2023-02-18 19:17:38,646 INFO L226 Difference]: Without dead ends: 55 [2023-02-18 19:17:38,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 98.2s TimeCoverageRelationStatistics Valid=138, Invalid=511, Unknown=13, NotChecked=150, Total=812 [2023-02-18 19:17:38,648 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 55 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 26 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 69.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 72.8s IncrementalHoareTripleChecker+Time [2023-02-18 19:17:38,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 109 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 240 Invalid, 22 Unknown, 122 Unchecked, 72.8s Time] [2023-02-18 19:17:38,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-02-18 19:17:38,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2023-02-18 19:17:38,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 36 states have internal predecessors, (42), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-18 19:17:38,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2023-02-18 19:17:38,658 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 33 [2023-02-18 19:17:38,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:17:38,659 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2023-02-18 19:17:38,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 15 states have internal predecessors, (33), 8 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-18 19:17:38,659 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2023-02-18 19:17:38,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-18 19:17:38,661 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:17:38,661 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:17:38,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-18 19:17:38,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 19:17:38,878 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:17:38,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:17:38,878 INFO L85 PathProgramCache]: Analyzing trace with hash 685673296, now seen corresponding path program 1 times [2023-02-18 19:17:38,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 19:17:38,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [364812705] [2023-02-18 19:17:38,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:17:38,879 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 19:17:38,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 19:17:38,879 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 19:17:38,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-18 19:17:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:17:39,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-18 19:17:39,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:17:49,236 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 19:17:49,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:17:54,042 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-18 19:17:54,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 19:17:54,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [364812705] [2023-02-18 19:17:54,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [364812705] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 19:17:54,043 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 19:17:54,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7] total 19 [2023-02-18 19:17:54,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411119886] [2023-02-18 19:17:54,043 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 19:17:54,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-18 19:17:54,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 19:17:54,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-18 19:17:54,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2023-02-18 19:17:54,045 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand has 19 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 15 states have internal predecessors, (36), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-18 19:18:09,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:18:09,533 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2023-02-18 19:18:09,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-18 19:18:09,542 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 15 states have internal predecessors, (36), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 39 [2023-02-18 19:18:09,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:18:09,546 INFO L225 Difference]: With dead ends: 69 [2023-02-18 19:18:09,546 INFO L226 Difference]: Without dead ends: 61 [2023-02-18 19:18:09,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 55 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2023-02-18 19:18:09,550 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2023-02-18 19:18:09,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 133 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2023-02-18 19:18:09,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-02-18 19:18:09,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 51. [2023-02-18 19:18:09,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.135135135135135) internal successors, (42), 38 states have internal predecessors, (42), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-18 19:18:09,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2023-02-18 19:18:09,558 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 39 [2023-02-18 19:18:09,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:18:09,558 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2023-02-18 19:18:09,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 15 states have internal predecessors, (36), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-18 19:18:09,558 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2023-02-18 19:18:09,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-18 19:18:09,559 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:18:09,559 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:18:09,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-18 19:18:09,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 19:18:09,768 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:18:09,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:18:09,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1683883622, now seen corresponding path program 1 times [2023-02-18 19:18:09,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 19:18:09,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1894863327] [2023-02-18 19:18:09,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:18:09,769 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 19:18:09,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 19:18:09,770 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 19:18:09,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-18 19:18:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:18:09,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-18 19:18:09,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:18:23,810 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-18 19:18:23,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:19:39,014 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul (_ bv2 64) |c_ULTIMATE.start_main_~x~0#1|)) (.cse0 (bvsdiv |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64))) (.cse2 (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|) ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|)))) (or (= (_ bv0 64) .cse0) (= (_ bv1 64) (bvsrem .cse0 (_ bv2 64))) (= (bvadd |c_ULTIMATE.start_main_~z~0#1| (bvmul (bvmul (_ bv2 64) .cse1) (bvsdiv .cse0 (_ bv2 64)))) .cse2) (not (= (bvadd |c_ULTIMATE.start_main_~z~0#1| (bvmul .cse1 .cse0)) .cse2)))) is different from true [2023-02-18 19:19:41,831 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul (_ bv2 64) |c_ULTIMATE.start_main_~x~0#1|)) (.cse0 (bvsdiv |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64))) (.cse2 (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|) ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|)))) (or (= (_ bv0 64) .cse0) (= (_ bv1 64) (bvsrem |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64))) (= (_ bv1 64) (bvsrem .cse0 (_ bv2 64))) (= (bvadd |c_ULTIMATE.start_main_~z~0#1| (bvmul (bvmul (_ bv2 64) .cse1) (bvsdiv .cse0 (_ bv2 64)))) .cse2) (not (= (bvadd |c_ULTIMATE.start_main_~z~0#1| (bvmul .cse1 .cse0)) .cse2)))) is different from true [2023-02-18 19:19:44,443 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse2 (bvsdiv .cse3 (_ bv2 64))) (.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|))) (let ((.cse0 (bvadd (bvmul (_ bv18446744073709551614 64) .cse2 .cse1) (bvmul .cse3 .cse1)))) (or (= (bvadd .cse0 (bvmul (bvmul (_ bv2 64) (bvmul (_ bv2 64) .cse1)) (bvsdiv .cse2 (_ bv2 64)))) (bvmul .cse1 .cse3)) (not (= .cse0 (_ bv0 64))) (= (_ bv0 64) .cse2) (= (_ bv1 64) (bvsrem .cse3 (_ bv2 64))) (= (_ bv1 64) (bvsrem .cse2 (_ bv2 64))))))) is different from true [2023-02-18 19:19:46,935 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse2 (bvsdiv .cse3 (_ bv2 64))) (.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|))) (let ((.cse0 (bvadd (bvmul (_ bv18446744073709551614 64) .cse2 .cse1) (bvmul .cse3 .cse1)))) (or (= (bvadd .cse0 (bvmul (bvmul (_ bv2 64) (bvmul (_ bv2 64) .cse1)) (bvsdiv .cse2 (_ bv2 64)))) (bvmul .cse1 .cse3)) (not (= .cse0 (_ bv0 64))) (= (_ bv0 64) .cse2) (= (_ bv1 64) (bvsrem .cse3 (_ bv2 64))) (= (_ bv1 64) (bvsrem .cse2 (_ bv2 64))) (not (bvsge |c_ULTIMATE.start_main_~b~0#1| (_ bv1 32))))))) is different from true [2023-02-18 19:19:53,235 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_21| (_ BitVec 32))) (let ((.cse1 ((_ sign_extend 32) |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_21|))) (let ((.cse0 (bvsdiv .cse1 (_ bv2 64)))) (or (= (_ bv0 64) .cse0) (= (_ bv1 64) (bvsrem .cse0 (_ bv2 64))) (bvsge |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_21| (_ bv1 32)) (= (_ bv1 64) (bvsrem .cse1 (_ bv2 64))) (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_26| (_ BitVec 32))) (let ((.cse3 ((_ sign_extend 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_26|))) (let ((.cse2 (bvadd (bvmul (_ bv18446744073709551614 64) .cse0 .cse3) (bvmul .cse1 .cse3)))) (or (not (= .cse2 (_ bv0 64))) (= (bvadd .cse2 (bvmul (bvmul (_ bv2 64) (bvmul (_ bv2 64) .cse3)) (bvsdiv .cse0 (_ bv2 64)))) (bvmul .cse3 .cse1))))))))))) is different from true [2023-02-18 19:19:59,532 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32))) (= (_ bv0 32) c_assume_abort_if_not_~cond) (forall ((|v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_21| (_ BitVec 32))) (let ((.cse1 ((_ sign_extend 32) |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_21|))) (let ((.cse0 (bvsdiv .cse1 (_ bv2 64)))) (or (= (_ bv0 64) .cse0) (= (_ bv1 64) (bvsrem .cse0 (_ bv2 64))) (bvsge |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_21| (_ bv1 32)) (= (_ bv1 64) (bvsrem .cse1 (_ bv2 64))) (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_26| (_ BitVec 32))) (let ((.cse3 ((_ sign_extend 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_26|))) (let ((.cse2 (bvadd (bvmul (_ bv18446744073709551614 64) .cse0 .cse3) (bvmul .cse1 .cse3)))) (or (not (= .cse2 (_ bv0 64))) (= (bvadd .cse2 (bvmul (bvmul (_ bv2 64) (bvmul (_ bv2 64) .cse3)) (bvsdiv .cse0 (_ bv2 64)))) (bvmul .cse3 .cse1))))))))))) is different from true [2023-02-18 19:20:09,203 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_22| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_27| (_ BitVec 32))) (let ((.cse2 ((_ sign_extend 32) |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_22|))) (let ((.cse1 (bvsdiv .cse2 (_ bv2 64))) (.cse3 ((_ sign_extend 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_27|))) (let ((.cse0 (bvadd (bvmul (_ bv18446744073709551614 64) .cse1 .cse3) (bvmul .cse2 .cse3)))) (or (not (= .cse0 (_ bv0 64))) (= (_ bv1 64) (bvsrem .cse1 (_ bv2 64))) (not (bvsge |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_22| (_ bv1 32))) (bvsle |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_22| (_ bv5 32)) (= (_ bv0 64) .cse1) (= (_ bv1 64) (bvsrem .cse2 (_ bv2 64))) (= (bvadd .cse0 (bvmul (bvmul (_ bv2 64) (bvmul (_ bv2 64) .cse3)) (bvsdiv .cse1 (_ bv2 64)))) (bvmul .cse3 .cse2)))))))) is different from true [2023-02-18 19:20:15,427 WARN L859 $PredicateComparison]: unable to prove that (or (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_22| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_27| (_ BitVec 32))) (let ((.cse2 ((_ sign_extend 32) |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_22|))) (let ((.cse1 (bvsdiv .cse2 (_ bv2 64))) (.cse3 ((_ sign_extend 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_27|))) (let ((.cse0 (bvadd (bvmul (_ bv18446744073709551614 64) .cse1 .cse3) (bvmul .cse2 .cse3)))) (or (not (= .cse0 (_ bv0 64))) (= (_ bv1 64) (bvsrem .cse1 (_ bv2 64))) (not (bvsge |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_22| (_ bv1 32))) (bvsle |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_22| (_ bv5 32)) (= (_ bv0 64) .cse1) (= (_ bv1 64) (bvsrem .cse2 (_ bv2 64))) (= (bvadd .cse0 (bvmul (bvmul (_ bv2 64) (bvmul (_ bv2 64) .cse3)) (bvsdiv .cse1 (_ bv2 64)))) (bvmul .cse3 .cse2))))))) (= (_ bv0 32) c_assume_abort_if_not_~cond)) is different from true [2023-02-18 19:20:17,520 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 10 not checked. [2023-02-18 19:20:17,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 19:20:17,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1894863327] [2023-02-18 19:20:17,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1894863327] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 19:20:17,521 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 19:20:17,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31 [2023-02-18 19:20:17,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67100056] [2023-02-18 19:20:17,521 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 19:20:17,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-18 19:20:17,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 19:20:17,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-18 19:20:17,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=409, Unknown=17, NotChecked=392, Total=930 [2023-02-18 19:20:17,522 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 31 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 25 states have internal predecessors, (49), 10 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2023-02-18 19:20:20,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:20:32,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:20:34,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:20:37,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-02-18 19:20:43,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:20:54,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:20:56,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:21:03,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:21:05,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:21:19,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:21:21,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:21:34,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:21:37,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:21:40,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:21:42,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:21:44,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:21:46,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:21:48,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:21:51,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:21:53,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:21:55,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:21:57,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:21:59,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:22:01,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:22:03,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:22:05,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:22:09,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:22:12,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:22:21,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:22:21,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:22:21,842 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2023-02-18 19:22:21,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-18 19:22:21,910 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 25 states have internal predecessors, (49), 10 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) Word has length 42 [2023-02-18 19:22:21,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:22:21,911 INFO L225 Difference]: With dead ends: 87 [2023-02-18 19:22:21,911 INFO L226 Difference]: Without dead ends: 76 [2023-02-18 19:22:21,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 43 SyntacticMatches, 15 SemanticMatches, 34 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 146.9s TimeCoverageRelationStatistics Valid=155, Invalid=611, Unknown=22, NotChecked=472, Total=1260 [2023-02-18 19:22:21,912 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 34 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 20 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 77.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 327 IncrementalHoareTripleChecker+Unchecked, 82.5s IncrementalHoareTripleChecker+Time [2023-02-18 19:22:21,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 125 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 348 Invalid, 27 Unknown, 327 Unchecked, 82.5s Time] [2023-02-18 19:22:21,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-02-18 19:22:21,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2023-02-18 19:22:21,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 58 states have internal predecessors, (61), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2023-02-18 19:22:21,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2023-02-18 19:22:21,921 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 42 [2023-02-18 19:22:21,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:22:21,921 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2023-02-18 19:22:21,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 25 states have internal predecessors, (49), 10 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2023-02-18 19:22:21,922 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2023-02-18 19:22:21,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-18 19:22:21,923 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:22:21,923 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:22:21,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-18 19:22:22,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 19:22:22,129 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:22:22,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:22:22,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1971106227, now seen corresponding path program 2 times [2023-02-18 19:22:22,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 19:22:22,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2074330576] [2023-02-18 19:22:22,130 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 19:22:22,130 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 19:22:22,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 19:22:22,131 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 19:22:22,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-18 19:22:22,301 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 19:22:22,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 19:22:22,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-18 19:22:22,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:22:32,707 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 19:22:32,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:22:56,108 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 19:22:56,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 19:22:56,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2074330576] [2023-02-18 19:22:56,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2074330576] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 19:22:56,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 19:22:56,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2023-02-18 19:22:56,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075197582] [2023-02-18 19:22:56,108 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 19:22:56,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 19:22:56,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 19:22:56,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 19:22:56,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=177, Unknown=1, NotChecked=0, Total=240 [2023-02-18 19:22:56,110 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 14 states have internal predecessors, (42), 10 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2023-02-18 19:23:09,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-02-18 19:23:14,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-02-18 19:23:24,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-02-18 19:23:27,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:23:27,878 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2023-02-18 19:23:27,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 19:23:27,951 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 14 states have internal predecessors, (42), 10 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 51 [2023-02-18 19:23:27,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:23:27,952 INFO L225 Difference]: With dead ends: 85 [2023-02-18 19:23:27,952 INFO L226 Difference]: Without dead ends: 44 [2023-02-18 19:23:27,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 82 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 42.5s TimeCoverageRelationStatistics Valid=137, Invalid=368, Unknown=1, NotChecked=0, Total=506 [2023-02-18 19:23:27,953 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 12 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.9s IncrementalHoareTripleChecker+Time [2023-02-18 19:23:27,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 136 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 21.9s Time] [2023-02-18 19:23:27,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-18 19:23:27,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-02-18 19:23:27,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.0) internal successors, (32), 32 states have internal predecessors, (32), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-18 19:23:27,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2023-02-18 19:23:27,958 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 51 [2023-02-18 19:23:27,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:23:27,962 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2023-02-18 19:23:27,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 14 states have internal predecessors, (42), 10 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2023-02-18 19:23:27,962 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2023-02-18 19:23:27,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-18 19:23:27,963 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:23:27,963 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:23:27,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-18 19:23:28,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 19:23:28,164 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:23:28,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:23:28,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1217167219, now seen corresponding path program 1 times [2023-02-18 19:23:28,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 19:23:28,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1342366521] [2023-02-18 19:23:28,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:23:28,169 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 19:23:28,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 19:23:28,170 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 19:23:28,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-18 19:23:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:23:28,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-18 19:23:28,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:23:41,937 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 19:23:41,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:24:12,849 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 19:24:12,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 19:24:12,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1342366521] [2023-02-18 19:24:12,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1342366521] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 19:24:12,850 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 19:24:12,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2023-02-18 19:24:12,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062587791] [2023-02-18 19:24:12,850 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 19:24:12,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-18 19:24:12,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 19:24:12,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-18 19:24:12,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=264, Unknown=2, NotChecked=0, Total=342 [2023-02-18 19:24:12,851 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2023-02-18 19:24:38,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:24:38,197 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2023-02-18 19:24:38,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 19:24:38,266 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 51 [2023-02-18 19:24:38,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:24:38,267 INFO L225 Difference]: With dead ends: 44 [2023-02-18 19:24:38,267 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 19:24:38,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 54.2s TimeCoverageRelationStatistics Valid=154, Invalid=494, Unknown=2, NotChecked=0, Total=650 [2023-02-18 19:24:38,268 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2023-02-18 19:24:38,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 94 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 14.4s Time] [2023-02-18 19:24:38,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 19:24:38,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 19:24:38,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 19:24:38,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 19:24:38,269 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2023-02-18 19:24:38,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:24:38,269 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 19:24:38,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2023-02-18 19:24:38,269 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 19:24:38,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 19:24:38,271 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-18 19:24:38,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-18 19:24:38,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 19:24:38,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 19:24:38,484 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 19:24:38,484 INFO L895 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (and (bvsge |ULTIMATE.start_main_~a~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~a~0#1| (_ bv5 32))) [2023-02-18 19:24:38,484 INFO L895 garLoopResultBuilder]: At program point L27-1(line 27) the Hoare annotation is: (and (bvsge |ULTIMATE.start_main_~a~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~b~0#1| (_ bv5 32)) (bvsge |ULTIMATE.start_main_~b~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~a~0#1| (_ bv5 32))) [2023-02-18 19:24:38,484 INFO L902 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: true [2023-02-18 19:24:38,485 INFO L899 garLoopResultBuilder]: For program point L25-1(line 25) no Hoare annotation was computed. [2023-02-18 19:24:38,485 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2023-02-18 19:24:38,485 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 19:24:38,485 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 20 49) the Hoare annotation is: true [2023-02-18 19:24:38,485 INFO L895 garLoopResultBuilder]: At program point L34-2(lines 34 45) the Hoare annotation is: (let ((.cse16 ((_ sign_extend 32) |ULTIMATE.start_main_~a~0#1|)) (.cse17 ((_ sign_extend 32) |ULTIMATE.start_main_~b~0#1|))) (let ((.cse27 (bvmul .cse16 .cse17))) (let ((.cse22 (bvmul (_ bv2 64) .cse16)) (.cse23 (= (_ bv1 64) (bvsrem .cse17 (_ bv2 64)))) (.cse28 (bvadd |ULTIMATE.start_main_~y~0#1| (_ bv1 64))) (.cse3 (bvsge |ULTIMATE.start_main_~a~0#1| (_ bv0 32))) (.cse4 (bvsle |ULTIMATE.start_main_~b~0#1| (_ bv5 32))) (.cse5 (bvsge |ULTIMATE.start_main_~b~0#1| (_ bv1 32))) (.cse26 (= |ULTIMATE.start_main_~z~0#1| .cse27)) (.cse6 (bvsge |ULTIMATE.start_main_~b~0#1| (_ bv0 32))) (.cse9 (bvsle |ULTIMATE.start_main_~a~0#1| (_ bv5 32))) (.cse8 (= (bvadd |ULTIMATE.start_main_~z~0#1| (bvmul |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) .cse27))) (let ((.cse0 (or (and .cse3 .cse4 .cse5 .cse6 .cse9 .cse8) (and .cse3 .cse4 .cse5 .cse26 .cse6 .cse9 .cse8))) (.cse1 (= (_ bv0 64) |ULTIMATE.start_main_~y~0#1|)) (.cse2 (= (_ bv1 64) (bvsrem .cse28 (_ bv2 64)))) (.cse7 (exists ((|ULTIMATE.start_main_~b~0#1| (_ BitVec 32))) (let ((.cse29 ((_ sign_extend 32) |ULTIMATE.start_main_~b~0#1|))) (and (= .cse28 (bvsdiv (bvadd .cse29 (_ bv18446744073709551615 64)) (_ bv2 64))) (bvsle |ULTIMATE.start_main_~b~0#1| (_ bv5 32)) (bvsge |ULTIMATE.start_main_~b~0#1| (_ bv0 32)) (= (_ bv1 64) (bvsrem .cse29 (_ bv2 64))))))) (.cse12 (or (= (bvadd (bvadd |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~x~0#1|) (bvmul (bvmul (_ bv2 64) |ULTIMATE.start_main_~x~0#1|) (bvsdiv (bvadd |ULTIMATE.start_main_~y~0#1| (_ bv18446744073709551615 64)) (_ bv2 64)))) .cse27) (not (= (_ bv1 64) (bvsrem |ULTIMATE.start_main_~y~0#1| (_ bv2 64)))))) (.cse13 (not .cse23)) (.cse18 (or (and .cse3 .cse4 .cse5 .cse26 .cse6 .cse9) (and .cse3 .cse4 .cse5 .cse6 .cse9))) (.cse10 (bvsdiv .cse17 (_ bv2 64))) (.cse21 (= (_ bv0 64) (bvsdiv |ULTIMATE.start_main_~y~0#1| (_ bv2 64)))) (.cse15 (= |ULTIMATE.start_main_~z~0#1| (_ bv0 64))) (.cse11 (exists ((|ULTIMATE.start_main_~b~0#1| (_ BitVec 32))) (let ((.cse25 ((_ sign_extend 32) |ULTIMATE.start_main_~b~0#1|))) (and (bvsle |ULTIMATE.start_main_~b~0#1| (_ bv5 32)) (bvsge |ULTIMATE.start_main_~b~0#1| (_ bv0 32)) (= (_ bv1 64) (bvsrem .cse25 (_ bv2 64))) (= |ULTIMATE.start_main_~y~0#1| (bvsdiv (bvadd .cse25 (_ bv18446744073709551615 64)) (_ bv2 64))))))) (.cse14 (= |ULTIMATE.start_main_~x~0#1| .cse22))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (= |ULTIMATE.start_main_~y~0#1| .cse10) .cse11 .cse12 .cse13 .cse14 .cse3 .cse4 .cse5 .cse6 .cse15 .cse9 .cse8) (and .cse3 .cse4 .cse5 .cse15 .cse6 (exists ((|ULTIMATE.start_main_~b~0#1| (_ BitVec 32))) (and (bvsle |ULTIMATE.start_main_~b~0#1| (_ bv5 32)) (bvsge |ULTIMATE.start_main_~b~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~y~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~b~0#1|)))) (= |ULTIMATE.start_main_~x~0#1| .cse16) .cse9 (= |ULTIMATE.start_main_~y~0#1| .cse17)) (and .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9) (and (exists ((|ULTIMATE.start_main_~b~0#1| (_ BitVec 32))) (let ((.cse20 ((_ sign_extend 32) |ULTIMATE.start_main_~b~0#1|))) (let ((.cse19 (bvsdiv (bvadd .cse20 (_ bv18446744073709551615 64)) (_ bv2 64)))) (and (= |ULTIMATE.start_main_~y~0#1| (bvsdiv .cse19 (_ bv2 64))) (bvsle |ULTIMATE.start_main_~b~0#1| (_ bv5 32)) (not (= (_ bv0 64) .cse19)) (not (= (_ bv1 64) (bvsrem .cse19 (_ bv2 64)))) (bvsge |ULTIMATE.start_main_~b~0#1| (_ bv0 32)) (= (_ bv1 64) (bvsrem .cse20 (_ bv2 64))))))) .cse11 .cse21 .cse12 .cse3 .cse4 .cse5 .cse6 .cse9 .cse8) (and .cse13 .cse3 .cse18 (= |ULTIMATE.start_main_~y~0#1| (bvsdiv .cse10 (_ bv2 64))) (= |ULTIMATE.start_main_~x~0#1| (bvmul (_ bv2 64) .cse22)) .cse5 .cse9 (not (= (_ bv1 64) (bvsrem .cse10 (_ bv2 64)))) .cse11 .cse21 .cse4 .cse15 .cse6) (let ((.cse24 (bvadd .cse17 (_ bv18446744073709551615 64)))) (and (= |ULTIMATE.start_main_~z~0#1| .cse16) (= |ULTIMATE.start_main_~x~0#1| (bvmul (_ bv2 64) |ULTIMATE.start_main_~z~0#1|)) .cse3 .cse5 .cse23 .cse9 .cse8 .cse11 .cse14 (= (bvadd (bvmul .cse16 (_ bv18446744073709551615 64)) |ULTIMATE.start_main_~z~0#1|) (_ bv0 64)) .cse4 .cse6 (= (_ bv1 64) (bvsrem (bvadd .cse24 (_ bv1 64)) (_ bv2 64))) (= |ULTIMATE.start_main_~y~0#1| (bvsdiv .cse24 (_ bv2 64)))))))))) [2023-02-18 19:24:38,485 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 19:24:38,486 INFO L895 garLoopResultBuilder]: At program point L34-3(lines 34 45) the Hoare annotation is: (let ((.cse7 ((_ sign_extend 32) |ULTIMATE.start_main_~b~0#1|))) (let ((.cse14 (bvadd .cse7 (_ bv18446744073709551615 64)))) (let ((.cse2 ((_ sign_extend 32) |ULTIMATE.start_main_~a~0#1|)) (.cse8 (bvsdiv .cse14 (_ bv2 64)))) (let ((.cse3 (bvsge |ULTIMATE.start_main_~a~0#1| (_ bv0 32))) (.cse4 (bvsle |ULTIMATE.start_main_~b~0#1| (_ bv5 32))) (.cse5 (bvsge |ULTIMATE.start_main_~b~0#1| (_ bv0 32))) (.cse10 (bvsle |ULTIMATE.start_main_~a~0#1| (_ bv5 32))) (.cse9 (= |ULTIMATE.start_main_~y~0#1| .cse8)) (.cse1 (bvmul .cse2 .cse7))) (let ((.cse6 (let ((.cse15 (bvmul (_ bv2 64) |ULTIMATE.start_main_~x~0#1|))) (let ((.cse11 (or (= (bvadd (bvadd |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~x~0#1|) (bvmul .cse15 (bvsdiv (bvadd |ULTIMATE.start_main_~y~0#1| (_ bv18446744073709551615 64)) (_ bv2 64)))) .cse1) (not (= (_ bv1 64) (bvsrem |ULTIMATE.start_main_~y~0#1| (_ bv2 64)))))) (.cse12 (= (bvadd |ULTIMATE.start_main_~z~0#1| (bvmul .cse15 (bvsdiv |ULTIMATE.start_main_~y~0#1| (_ bv2 64)))) .cse1)) (.cse13 (bvsge |ULTIMATE.start_main_~b~0#1| (_ bv1 32)))) (or (and .cse11 .cse12 .cse3 .cse4 .cse13 .cse5 .cse10 (= (bvadd |ULTIMATE.start_main_~z~0#1| (bvmul |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) .cse1)) (and .cse11 .cse3 .cse4 .cse13 .cse5 .cse10) (and (= |ULTIMATE.start_main_~z~0#1| .cse2) .cse12 (= |ULTIMATE.start_main_~x~0#1| (bvmul (_ bv2 64) |ULTIMATE.start_main_~z~0#1|)) .cse3 .cse4 .cse13 .cse5 (= (_ bv1 64) (bvsrem (bvadd .cse14 (_ bv1 64)) (_ bv2 64))) .cse10 .cse9)))))) (or (let ((.cse0 (bvmul (_ bv2 64) .cse2))) (and (= (bvadd |ULTIMATE.start_main_~z~0#1| (bvmul .cse0 (_ bv0 64))) .cse1) (= |ULTIMATE.start_main_~x~0#1| .cse0) (= (bvadd (bvmul .cse2 (_ bv18446744073709551615 64)) |ULTIMATE.start_main_~z~0#1|) (_ bv0 64)) .cse3 .cse4 .cse5 .cse6 (= (_ bv1 64) (bvsrem .cse7 (_ bv2 64))) (= (_ bv0 64) .cse8) .cse9 .cse10)) (and .cse3 .cse4 (= |ULTIMATE.start_main_~z~0#1| .cse1) .cse5 .cse6 .cse10))))))) [2023-02-18 19:24:38,486 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 19:24:38,486 INFO L899 garLoopResultBuilder]: For program point L28(line 28) no Hoare annotation was computed. [2023-02-18 19:24:38,486 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 42) no Hoare annotation was computed. [2023-02-18 19:24:38,486 INFO L899 garLoopResultBuilder]: For program point L39-2(lines 39 42) no Hoare annotation was computed. [2023-02-18 19:24:38,486 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse16 ((_ sign_extend 32) |ULTIMATE.start_main_~a~0#1|)) (.cse17 ((_ sign_extend 32) |ULTIMATE.start_main_~b~0#1|))) (let ((.cse27 (bvmul .cse16 .cse17))) (let ((.cse22 (bvmul (_ bv2 64) .cse16)) (.cse23 (= (_ bv1 64) (bvsrem .cse17 (_ bv2 64)))) (.cse28 (bvadd |ULTIMATE.start_main_~y~0#1| (_ bv1 64))) (.cse3 (bvsge |ULTIMATE.start_main_~a~0#1| (_ bv0 32))) (.cse4 (bvsle |ULTIMATE.start_main_~b~0#1| (_ bv5 32))) (.cse5 (bvsge |ULTIMATE.start_main_~b~0#1| (_ bv1 32))) (.cse26 (= |ULTIMATE.start_main_~z~0#1| .cse27)) (.cse6 (bvsge |ULTIMATE.start_main_~b~0#1| (_ bv0 32))) (.cse9 (bvsle |ULTIMATE.start_main_~a~0#1| (_ bv5 32))) (.cse8 (= (bvadd |ULTIMATE.start_main_~z~0#1| (bvmul |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) .cse27))) (let ((.cse0 (or (and .cse3 .cse4 .cse5 .cse6 .cse9 .cse8) (and .cse3 .cse4 .cse5 .cse26 .cse6 .cse9 .cse8))) (.cse1 (= (_ bv0 64) |ULTIMATE.start_main_~y~0#1|)) (.cse2 (= (_ bv1 64) (bvsrem .cse28 (_ bv2 64)))) (.cse7 (exists ((|ULTIMATE.start_main_~b~0#1| (_ BitVec 32))) (let ((.cse29 ((_ sign_extend 32) |ULTIMATE.start_main_~b~0#1|))) (and (= .cse28 (bvsdiv (bvadd .cse29 (_ bv18446744073709551615 64)) (_ bv2 64))) (bvsle |ULTIMATE.start_main_~b~0#1| (_ bv5 32)) (bvsge |ULTIMATE.start_main_~b~0#1| (_ bv0 32)) (= (_ bv1 64) (bvsrem .cse29 (_ bv2 64))))))) (.cse12 (or (= (bvadd (bvadd |ULTIMATE.start_main_~z~0#1| |ULTIMATE.start_main_~x~0#1|) (bvmul (bvmul (_ bv2 64) |ULTIMATE.start_main_~x~0#1|) (bvsdiv (bvadd |ULTIMATE.start_main_~y~0#1| (_ bv18446744073709551615 64)) (_ bv2 64)))) .cse27) (not (= (_ bv1 64) (bvsrem |ULTIMATE.start_main_~y~0#1| (_ bv2 64)))))) (.cse13 (not .cse23)) (.cse18 (or (and .cse3 .cse4 .cse5 .cse26 .cse6 .cse9) (and .cse3 .cse4 .cse5 .cse6 .cse9))) (.cse10 (bvsdiv .cse17 (_ bv2 64))) (.cse21 (= (_ bv0 64) (bvsdiv |ULTIMATE.start_main_~y~0#1| (_ bv2 64)))) (.cse15 (= |ULTIMATE.start_main_~z~0#1| (_ bv0 64))) (.cse11 (exists ((|ULTIMATE.start_main_~b~0#1| (_ BitVec 32))) (let ((.cse25 ((_ sign_extend 32) |ULTIMATE.start_main_~b~0#1|))) (and (bvsle |ULTIMATE.start_main_~b~0#1| (_ bv5 32)) (bvsge |ULTIMATE.start_main_~b~0#1| (_ bv0 32)) (= (_ bv1 64) (bvsrem .cse25 (_ bv2 64))) (= |ULTIMATE.start_main_~y~0#1| (bvsdiv (bvadd .cse25 (_ bv18446744073709551615 64)) (_ bv2 64))))))) (.cse14 (= |ULTIMATE.start_main_~x~0#1| .cse22))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (= |ULTIMATE.start_main_~y~0#1| .cse10) .cse11 .cse12 .cse13 .cse14 .cse3 .cse4 .cse5 .cse6 .cse15 .cse9 .cse8) (and .cse3 .cse4 .cse5 .cse15 .cse6 (exists ((|ULTIMATE.start_main_~b~0#1| (_ BitVec 32))) (and (bvsle |ULTIMATE.start_main_~b~0#1| (_ bv5 32)) (bvsge |ULTIMATE.start_main_~b~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~y~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~b~0#1|)))) (= |ULTIMATE.start_main_~x~0#1| .cse16) .cse9 (= |ULTIMATE.start_main_~y~0#1| .cse17)) (and .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9) (and (exists ((|ULTIMATE.start_main_~b~0#1| (_ BitVec 32))) (let ((.cse20 ((_ sign_extend 32) |ULTIMATE.start_main_~b~0#1|))) (let ((.cse19 (bvsdiv (bvadd .cse20 (_ bv18446744073709551615 64)) (_ bv2 64)))) (and (= |ULTIMATE.start_main_~y~0#1| (bvsdiv .cse19 (_ bv2 64))) (bvsle |ULTIMATE.start_main_~b~0#1| (_ bv5 32)) (not (= (_ bv0 64) .cse19)) (not (= (_ bv1 64) (bvsrem .cse19 (_ bv2 64)))) (bvsge |ULTIMATE.start_main_~b~0#1| (_ bv0 32)) (= (_ bv1 64) (bvsrem .cse20 (_ bv2 64))))))) .cse11 .cse21 .cse12 .cse3 .cse4 .cse5 .cse6 .cse9 .cse8) (and .cse13 .cse3 .cse18 (= |ULTIMATE.start_main_~y~0#1| (bvsdiv .cse10 (_ bv2 64))) (= |ULTIMATE.start_main_~x~0#1| (bvmul (_ bv2 64) .cse22)) .cse5 .cse9 (not (= (_ bv1 64) (bvsrem .cse10 (_ bv2 64)))) .cse11 .cse21 .cse4 .cse15 .cse6) (let ((.cse24 (bvadd .cse17 (_ bv18446744073709551615 64)))) (and (= |ULTIMATE.start_main_~z~0#1| .cse16) (= |ULTIMATE.start_main_~x~0#1| (bvmul (_ bv2 64) |ULTIMATE.start_main_~z~0#1|)) .cse3 .cse5 .cse23 .cse9 .cse8 .cse11 .cse14 (= (bvadd (bvmul .cse16 (_ bv18446744073709551615 64)) |ULTIMATE.start_main_~z~0#1|) (_ bv0 64)) .cse4 .cse6 (= (_ bv1 64) (bvsrem (bvadd .cse24 (_ bv1 64)) (_ bv2 64))) (= |ULTIMATE.start_main_~y~0#1| (bvsdiv .cse24 (_ bv2 64)))))))))) [2023-02-18 19:24:38,486 INFO L899 garLoopResultBuilder]: For program point L35-1(lines 34 45) no Hoare annotation was computed. [2023-02-18 19:24:38,487 INFO L899 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2023-02-18 19:24:38,487 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 9 11) the Hoare annotation is: true [2023-02-18 19:24:38,487 INFO L899 garLoopResultBuilder]: For program point L10-2(lines 9 11) no Hoare annotation was computed. [2023-02-18 19:24:38,487 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 9 11) no Hoare annotation was computed. [2023-02-18 19:24:38,487 INFO L899 garLoopResultBuilder]: For program point L14(lines 14 15) no Hoare annotation was computed. [2023-02-18 19:24:38,487 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 16) no Hoare annotation was computed. [2023-02-18 19:24:38,487 INFO L899 garLoopResultBuilder]: For program point L13-2(lines 12 18) no Hoare annotation was computed. [2023-02-18 19:24:38,487 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 12 18) no Hoare annotation was computed. [2023-02-18 19:24:38,487 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 12 18) the Hoare annotation is: true [2023-02-18 19:24:38,488 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2023-02-18 19:24:38,490 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-02-18 19:24:38,491 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 19:24:38,497 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,498 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,500 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,500 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,500 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,500 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,500 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,500 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,501 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,501 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,501 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,501 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,501 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,503 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,503 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,503 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,503 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,503 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,504 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,504 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,504 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,504 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,504 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,504 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,504 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,504 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,504 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,505 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,505 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,505 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,505 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,505 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,505 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,505 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,506 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,506 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,506 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,514 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,514 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,514 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,514 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,514 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,515 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,515 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,515 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,515 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,515 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,515 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,516 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,516 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,516 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,516 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,516 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,516 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,529 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,530 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,530 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,530 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,530 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,530 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,530 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,531 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,531 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,531 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,531 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,531 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,531 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,531 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,532 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,532 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,532 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,532 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,532 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,532 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 07:24:38 BoogieIcfgContainer [2023-02-18 19:24:38,535 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 19:24:38,535 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 19:24:38,536 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 19:24:38,536 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 19:24:38,536 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:14:27" (3/4) ... [2023-02-18 19:24:38,538 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-18 19:24:38,542 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-02-18 19:24:38,542 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-18 19:24:38,549 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-02-18 19:24:38,549 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-18 19:24:38,549 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-18 19:24:38,549 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-18 19:24:38,565 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((~bvsge32(a, 0bv32) && ~bvsle32(b, 5bv32)) && ~bvsge32(b, 1bv32)) && ~bvsge32(b, 0bv32)) && ~bvsle32(a, 5bv32)) && ~bvadd128(z, ~bvmul64(x, y)) == ~bvmul64(~sign_extendFrom8To32(a), ~sign_extendFrom8To32(b))) || ((((((~bvsge32(a, 0bv32) && ~bvsle32(b, 5bv32)) && ~bvsge32(b, 1bv32)) && z == ~bvmul64(~sign_extendFrom8To32(a), ~sign_extendFrom8To32(b))) && ~bvsge32(b, 0bv32)) && ~bvsle32(a, 5bv32)) && ~bvadd128(z, ~bvmul64(x, y)) == ~bvmul64(~sign_extendFrom8To32(a), ~sign_extendFrom8To32(b)))) && 0bv64 == y) && 1bv64 == ~bvsrem64(~bvadd128(y, 1bv64), 2bv64)) && ~bvsge32(a, 0bv32)) && ~bvsle32(b, 5bv32)) && ~bvsge32(b, 1bv32)) && ~bvsge32(b, 0bv32)) && (\exists ULTIMATE.start_main_~b~0#1 : bv32 :: ((~bvadd128(y, 1bv64) == ~bvsdiv64(~bvadd128(~sign_extendFrom8To32(ULTIMATE.start_main_~b~0#1), 18446744073709551615bv64), 2bv64) && ~bvsle32(ULTIMATE.start_main_~b~0#1, 5bv32)) && ~bvsge32(ULTIMATE.start_main_~b~0#1, 0bv32)) && 1bv64 == ~bvsrem64(~sign_extendFrom8To32(ULTIMATE.start_main_~b~0#1), 2bv64))) && ~bvadd128(z, ~bvmul64(x, y)) == ~bvmul64(~sign_extendFrom8To32(a), ~sign_extendFrom8To32(b))) && ~bvsle32(a, 5bv32)) || (((((((((((y == ~bvsdiv64(~sign_extendFrom8To32(b), 2bv64) && (\exists ULTIMATE.start_main_~b~0#1 : bv32 :: ((~bvsle32(ULTIMATE.start_main_~b~0#1, 5bv32) && ~bvsge32(ULTIMATE.start_main_~b~0#1, 0bv32)) && 1bv64 == ~bvsrem64(~sign_extendFrom8To32(ULTIMATE.start_main_~b~0#1), 2bv64)) && y == ~bvsdiv64(~bvadd128(~sign_extendFrom8To32(ULTIMATE.start_main_~b~0#1), 18446744073709551615bv64), 2bv64))) && (~bvadd128(~bvadd128(z, x), ~bvmul64(~bvmul64(2bv64, x), ~bvsdiv64(~bvadd128(y, 18446744073709551615bv64), 2bv64))) == ~bvmul64(~sign_extendFrom8To32(a), ~sign_extendFrom8To32(b)) || !(1bv64 == ~bvsrem64(y, 2bv64)))) && !(1bv64 == ~bvsrem64(~sign_extendFrom8To32(b), 2bv64))) && x == ~bvmul64(2bv64, ~sign_extendFrom8To32(a))) && ~bvsge32(a, 0bv32)) && ~bvsle32(b, 5bv32)) && ~bvsge32(b, 1bv32)) && ~bvsge32(b, 0bv32)) && z == 0bv64) && ~bvsle32(a, 5bv32)) && ~bvadd128(z, ~bvmul64(x, y)) == ~bvmul64(~sign_extendFrom8To32(a), ~sign_extendFrom8To32(b)))) || ((((((((~bvsge32(a, 0bv32) && ~bvsle32(b, 5bv32)) && ~bvsge32(b, 1bv32)) && z == 0bv64) && ~bvsge32(b, 0bv32)) && (\exists ULTIMATE.start_main_~b~0#1 : bv32 :: (~bvsle32(ULTIMATE.start_main_~b~0#1, 5bv32) && ~bvsge32(ULTIMATE.start_main_~b~0#1, 0bv32)) && y == ~sign_extendFrom8To32(ULTIMATE.start_main_~b~0#1))) && x == ~sign_extendFrom8To32(a)) && ~bvsle32(a, 5bv32)) && y == ~sign_extendFrom8To32(b))) || (((((((((0bv64 == y && 1bv64 == ~bvsrem64(~bvadd128(y, 1bv64), 2bv64)) && ~bvsge32(a, 0bv32)) && ((((((~bvsge32(a, 0bv32) && ~bvsle32(b, 5bv32)) && ~bvsge32(b, 1bv32)) && z == ~bvmul64(~sign_extendFrom8To32(a), ~sign_extendFrom8To32(b))) && ~bvsge32(b, 0bv32)) && ~bvsle32(a, 5bv32)) || ((((~bvsge32(a, 0bv32) && ~bvsle32(b, 5bv32)) && ~bvsge32(b, 1bv32)) && ~bvsge32(b, 0bv32)) && ~bvsle32(a, 5bv32)))) && ~bvsle32(b, 5bv32)) && ~bvsge32(b, 1bv32)) && ~bvsge32(b, 0bv32)) && (\exists ULTIMATE.start_main_~b~0#1 : bv32 :: ((~bvadd128(y, 1bv64) == ~bvsdiv64(~bvadd128(~sign_extendFrom8To32(ULTIMATE.start_main_~b~0#1), 18446744073709551615bv64), 2bv64) && ~bvsle32(ULTIMATE.start_main_~b~0#1, 5bv32)) && ~bvsge32(ULTIMATE.start_main_~b~0#1, 0bv32)) && 1bv64 == ~bvsrem64(~sign_extendFrom8To32(ULTIMATE.start_main_~b~0#1), 2bv64))) && ~bvadd128(z, ~bvmul64(x, y)) == ~bvmul64(~sign_extendFrom8To32(a), ~sign_extendFrom8To32(b))) && ~bvsle32(a, 5bv32))) || ((((((((((((((~bvsge32(a, 0bv32) && ~bvsle32(b, 5bv32)) && ~bvsge32(b, 1bv32)) && ~bvsge32(b, 0bv32)) && ~bvsle32(a, 5bv32)) && ~bvadd128(z, ~bvmul64(x, y)) == ~bvmul64(~sign_extendFrom8To32(a), ~sign_extendFrom8To32(b))) || ((((((~bvsge32(a, 0bv32) && ~bvsle32(b, 5bv32)) && ~bvsge32(b, 1bv32)) && z == ~bvmul64(~sign_extendFrom8To32(a), ~sign_extendFrom8To32(b))) && ~bvsge32(b, 0bv32)) && ~bvsle32(a, 5bv32)) && ~bvadd128(z, ~bvmul64(x, y)) == ~bvmul64(~sign_extendFrom8To32(a), ~sign_extendFrom8To32(b)))) && 0bv64 == y) && 1bv64 == ~bvsrem64(~bvadd128(y, 1bv64), 2bv64)) && ~bvsge32(a, 0bv32)) && ~bvsle32(b, 5bv32)) && ~bvsge32(b, 1bv32)) && ~bvsge32(b, 0bv32)) && (\exists ULTIMATE.start_main_~b~0#1 : bv32 :: ((~bvadd128(y, 1bv64) == ~bvsdiv64(~bvadd128(~sign_extendFrom8To32(ULTIMATE.start_main_~b~0#1), 18446744073709551615bv64), 2bv64) && ~bvsle32(ULTIMATE.start_main_~b~0#1, 5bv32)) && ~bvsge32(ULTIMATE.start_main_~b~0#1, 0bv32)) && 1bv64 == ~bvsrem64(~sign_extendFrom8To32(ULTIMATE.start_main_~b~0#1), 2bv64))) && ~bvsle32(a, 5bv32))) || ((((((((((\exists ULTIMATE.start_main_~b~0#1 : bv32 :: ((((y == ~bvsdiv64(~bvsdiv64(~bvadd128(~sign_extendFrom8To32(ULTIMATE.start_main_~b~0#1), 18446744073709551615bv64), 2bv64), 2bv64) && ~bvsle32(ULTIMATE.start_main_~b~0#1, 5bv32)) && !(0bv64 == ~bvsdiv64(~bvadd128(~sign_extendFrom8To32(ULTIMATE.start_main_~b~0#1), 18446744073709551615bv64), 2bv64))) && !(1bv64 == ~bvsrem64(~bvsdiv64(~bvadd128(~sign_extendFrom8To32(ULTIMATE.start_main_~b~0#1), 18446744073709551615bv64), 2bv64), 2bv64))) && ~bvsge32(ULTIMATE.start_main_~b~0#1, 0bv32)) && 1bv64 == ~bvsrem64(~sign_extendFrom8To32(ULTIMATE.start_main_~b~0#1), 2bv64)) && (\exists ULTIMATE.start_main_~b~0#1 : bv32 :: ((~bvsle32(ULTIMATE.start_main_~b~0#1, 5bv32) && ~bvsge32(ULTIMATE.start_main_~b~0#1, 0bv32)) && 1bv64 == ~bvsrem64(~sign_extendFrom8To32(ULTIMATE.start_main_~b~0#1), 2bv64)) && y == ~bvsdiv64(~bvadd128(~sign_extendFrom8To32(ULTIMATE.start_main_~b~0#1), 18446744073709551615bv64), 2bv64))) && 0bv64 == ~bvsdiv64(y, 2bv64)) && (~bvadd128(~bvadd128(z, x), ~bvmul64(~bvmul64(2bv64, x), ~bvsdiv64(~bvadd128(y, 18446744073709551615bv64), 2bv64))) == ~bvmul64(~sign_extendFrom8To32(a), ~sign_extendFrom8To32(b)) || !(1bv64 == ~bvsrem64(y, 2bv64)))) && ~bvsge32(a, 0bv32)) && ~bvsle32(b, 5bv32)) && ~bvsge32(b, 1bv32)) && ~bvsge32(b, 0bv32)) && ~bvsle32(a, 5bv32)) && ~bvadd128(z, ~bvmul64(x, y)) == ~bvmul64(~sign_extendFrom8To32(a), ~sign_extendFrom8To32(b)))) || ((((((((((((!(1bv64 == ~bvsrem64(~sign_extendFrom8To32(b), 2bv64)) && ~bvsge32(a, 0bv32)) && ((((((~bvsge32(a, 0bv32) && ~bvsle32(b, 5bv32)) && ~bvsge32(b, 1bv32)) && z == ~bvmul64(~sign_extendFrom8To32(a), ~sign_extendFrom8To32(b))) && ~bvsge32(b, 0bv32)) && ~bvsle32(a, 5bv32)) || ((((~bvsge32(a, 0bv32) && ~bvsle32(b, 5bv32)) && ~bvsge32(b, 1bv32)) && ~bvsge32(b, 0bv32)) && ~bvsle32(a, 5bv32)))) && y == ~bvsdiv64(~bvsdiv64(~sign_extendFrom8To32(b), 2bv64), 2bv64)) && x == ~bvmul64(2bv64, ~bvmul64(2bv64, ~sign_extendFrom8To32(a)))) && ~bvsge32(b, 1bv32)) && ~bvsle32(a, 5bv32)) && !(1bv64 == ~bvsrem64(~bvsdiv64(~sign_extendFrom8To32(b), 2bv64), 2bv64))) && (\exists ULTIMATE.start_main_~b~0#1 : bv32 :: ((~bvsle32(ULTIMATE.start_main_~b~0#1, 5bv32) && ~bvsge32(ULTIMATE.start_main_~b~0#1, 0bv32)) && 1bv64 == ~bvsrem64(~sign_extendFrom8To32(ULTIMATE.start_main_~b~0#1), 2bv64)) && y == ~bvsdiv64(~bvadd128(~sign_extendFrom8To32(ULTIMATE.start_main_~b~0#1), 18446744073709551615bv64), 2bv64))) && 0bv64 == ~bvsdiv64(y, 2bv64)) && ~bvsle32(b, 5bv32)) && z == 0bv64) && ~bvsge32(b, 0bv32))) || (((((((((((((z == ~sign_extendFrom8To32(a) && x == ~bvmul64(2bv64, z)) && ~bvsge32(a, 0bv32)) && ~bvsge32(b, 1bv32)) && 1bv64 == ~bvsrem64(~sign_extendFrom8To32(b), 2bv64)) && ~bvsle32(a, 5bv32)) && ~bvadd128(z, ~bvmul64(x, y)) == ~bvmul64(~sign_extendFrom8To32(a), ~sign_extendFrom8To32(b))) && (\exists ULTIMATE.start_main_~b~0#1 : bv32 :: ((~bvsle32(ULTIMATE.start_main_~b~0#1, 5bv32) && ~bvsge32(ULTIMATE.start_main_~b~0#1, 0bv32)) && 1bv64 == ~bvsrem64(~sign_extendFrom8To32(ULTIMATE.start_main_~b~0#1), 2bv64)) && y == ~bvsdiv64(~bvadd128(~sign_extendFrom8To32(ULTIMATE.start_main_~b~0#1), 18446744073709551615bv64), 2bv64))) && x == ~bvmul64(2bv64, ~sign_extendFrom8To32(a))) && ~bvadd128(~bvmul64(~sign_extendFrom8To32(a), 18446744073709551615bv64), z) == 0bv64) && ~bvsle32(b, 5bv32)) && ~bvsge32(b, 0bv32)) && 1bv64 == ~bvsrem64(~bvadd128(~bvadd128(~sign_extendFrom8To32(b), 18446744073709551615bv64), 1bv64), 2bv64)) && y == ~bvsdiv64(~bvadd128(~sign_extendFrom8To32(b), 18446744073709551615bv64), 2bv64)) [2023-02-18 19:24:38,570 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 19:24:38,570 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 19:24:38,570 INFO L158 Benchmark]: Toolchain (without parser) took 612044.63ms. Allocated memory is still 102.8MB. Free memory was 80.1MB in the beginning and 33.8MB in the end (delta: 46.3MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. [2023-02-18 19:24:38,571 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 75.5MB. Free memory was 52.5MB in the beginning and 52.5MB in the end (delta: 79.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 19:24:38,571 INFO L158 Benchmark]: CACSL2BoogieTranslator took 135.03ms. Allocated memory is still 102.8MB. Free memory was 79.8MB in the beginning and 69.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 19:24:38,571 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.76ms. Allocated memory is still 102.8MB. Free memory was 69.0MB in the beginning and 67.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 19:24:38,571 INFO L158 Benchmark]: Boogie Preprocessor took 14.36ms. Allocated memory is still 102.8MB. Free memory was 67.7MB in the beginning and 66.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 19:24:38,571 INFO L158 Benchmark]: RCFGBuilder took 355.23ms. Allocated memory is still 102.8MB. Free memory was 66.4MB in the beginning and 56.2MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 19:24:38,572 INFO L158 Benchmark]: TraceAbstraction took 611481.65ms. Allocated memory is still 102.8MB. Free memory was 55.4MB in the beginning and 37.0MB in the end (delta: 18.4MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. [2023-02-18 19:24:38,572 INFO L158 Benchmark]: Witness Printer took 34.57ms. Allocated memory is still 102.8MB. Free memory was 37.0MB in the beginning and 33.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-18 19:24:38,573 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 75.5MB. Free memory was 52.5MB in the beginning and 52.5MB in the end (delta: 79.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 135.03ms. Allocated memory is still 102.8MB. Free memory was 79.8MB in the beginning and 69.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.76ms. Allocated memory is still 102.8MB. Free memory was 69.0MB in the beginning and 67.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 14.36ms. Allocated memory is still 102.8MB. Free memory was 67.7MB in the beginning and 66.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 355.23ms. Allocated memory is still 102.8MB. Free memory was 66.4MB in the beginning and 56.2MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 611481.65ms. Allocated memory is still 102.8MB. Free memory was 55.4MB in the beginning and 37.0MB in the end (delta: 18.4MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. * Witness Printer took 34.57ms. Allocated memory is still 102.8MB. Free memory was 37.0MB in the beginning and 33.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 15]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 611.3s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 340.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 49 mSolverCounterUnknown, 181 SdHoareTripleChecker+Valid, 202.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 173 mSDsluCounter, 707 SdHoareTripleChecker+Invalid, 186.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 449 IncrementalHoareTripleChecker+Unchecked, 562 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1285 IncrementalHoareTripleChecker+Invalid, 1867 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 145 mSDtfsCounter, 1285 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 513 GetRequests, 338 SyntacticMatches, 36 SemanticMatches, 139 ConstructedPredicates, 11 IntricatePredicates, 1 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 361.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=5, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 20 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 28 PreInvPairs, 49 NumberOfFragments, 2068 HoareAnnotationTreeSize, 28 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 268.9s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 468 ConstructedInterpolants, 36 QuantifiedInterpolants, 4534 SizeOfPredicates, 32 NumberOfNonLiveVariables, 469 ConjunctsInSsa, 101 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 297/364 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 34]: Loop Invariant [2023-02-18 19:24:38,585 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,585 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,585 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,585 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,585 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,586 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,586 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,586 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,586 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,586 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,586 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,586 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,586 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,587 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,587 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,587 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,587 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,587 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,587 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,587 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,587 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,588 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,588 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,588 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,588 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,588 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,588 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,588 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,588 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,588 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,588 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,588 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,588 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,589 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,589 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,589 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,589 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,593 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,593 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,593 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,593 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,593 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,599 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,599 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,599 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,599 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,599 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,599 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,600 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,600 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,600 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,600 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,600 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,600 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,600 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,600 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,601 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,601 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,601 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,601 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,601 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,601 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,601 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,601 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,603 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] [2023-02-18 19:24:38,603 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~b~0#1,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((~bvsge32(a, 0bv32) && ~bvsle32(b, 5bv32)) && ~bvsge32(b, 1bv32)) && ~bvsge32(b, 0bv32)) && ~bvsle32(a, 5bv32)) && ~bvadd128(z, ~bvmul64(x, y)) == ~bvmul64(~sign_extendFrom8To32(a), ~sign_extendFrom8To32(b))) || ((((((~bvsge32(a, 0bv32) && ~bvsle32(b, 5bv32)) && ~bvsge32(b, 1bv32)) && z == ~bvmul64(~sign_extendFrom8To32(a), ~sign_extendFrom8To32(b))) && ~bvsge32(b, 0bv32)) && ~bvsle32(a, 5bv32)) && ~bvadd128(z, ~bvmul64(x, y)) == ~bvmul64(~sign_extendFrom8To32(a), ~sign_extendFrom8To32(b)))) && 0bv64 == y) && 1bv64 == ~bvsrem64(~bvadd128(y, 1bv64), 2bv64)) && ~bvsge32(a, 0bv32)) && ~bvsle32(b, 5bv32)) && ~bvsge32(b, 1bv32)) && ~bvsge32(b, 0bv32)) && (\exists ULTIMATE.start_main_~b~0#1 : bv32 :: ((~bvadd128(y, 1bv64) == ~bvsdiv64(~bvadd128(~sign_extendFrom8To32(ULTIMATE.start_main_~b~0#1), 18446744073709551615bv64), 2bv64) && ~bvsle32(ULTIMATE.start_main_~b~0#1, 5bv32)) && ~bvsge32(ULTIMATE.start_main_~b~0#1, 0bv32)) && 1bv64 == ~bvsrem64(~sign_extendFrom8To32(ULTIMATE.start_main_~b~0#1), 2bv64))) && ~bvadd128(z, ~bvmul64(x, y)) == ~bvmul64(~sign_extendFrom8To32(a), ~sign_extendFrom8To32(b))) && ~bvsle32(a, 5bv32)) || (((((((((((y == ~bvsdiv64(~sign_extendFrom8To32(b), 2bv64) && (\exists ULTIMATE.start_main_~b~0#1 : bv32 :: ((~bvsle32(ULTIMATE.start_main_~b~0#1, 5bv32) && ~bvsge32(ULTIMATE.start_main_~b~0#1, 0bv32)) && 1bv64 == ~bvsrem64(~sign_extendFrom8To32(ULTIMATE.start_main_~b~0#1), 2bv64)) && y == ~bvsdiv64(~bvadd128(~sign_extendFrom8To32(ULTIMATE.start_main_~b~0#1), 18446744073709551615bv64), 2bv64))) && (~bvadd128(~bvadd128(z, x), ~bvmul64(~bvmul64(2bv64, x), ~bvsdiv64(~bvadd128(y, 18446744073709551615bv64), 2bv64))) == ~bvmul64(~sign_extendFrom8To32(a), ~sign_extendFrom8To32(b)) || !(1bv64 == ~bvsrem64(y, 2bv64)))) && !(1bv64 == ~bvsrem64(~sign_extendFrom8To32(b), 2bv64))) && x == ~bvmul64(2bv64, ~sign_extendFrom8To32(a))) && ~bvsge32(a, 0bv32)) && ~bvsle32(b, 5bv32)) && ~bvsge32(b, 1bv32)) && ~bvsge32(b, 0bv32)) && z == 0bv64) && ~bvsle32(a, 5bv32)) && ~bvadd128(z, ~bvmul64(x, y)) == ~bvmul64(~sign_extendFrom8To32(a), ~sign_extendFrom8To32(b)))) || ((((((((~bvsge32(a, 0bv32) && ~bvsle32(b, 5bv32)) && ~bvsge32(b, 1bv32)) && z == 0bv64) && ~bvsge32(b, 0bv32)) && (\exists ULTIMATE.start_main_~b~0#1 : bv32 :: (~bvsle32(ULTIMATE.start_main_~b~0#1, 5bv32) && ~bvsge32(ULTIMATE.start_main_~b~0#1, 0bv32)) && y == ~sign_extendFrom8To32(ULTIMATE.start_main_~b~0#1))) && x == ~sign_extendFrom8To32(a)) && ~bvsle32(a, 5bv32)) && y == ~sign_extendFrom8To32(b))) || (((((((((0bv64 == y && 1bv64 == ~bvsrem64(~bvadd128(y, 1bv64), 2bv64)) && ~bvsge32(a, 0bv32)) && ((((((~bvsge32(a, 0bv32) && ~bvsle32(b, 5bv32)) && ~bvsge32(b, 1bv32)) && z == ~bvmul64(~sign_extendFrom8To32(a), ~sign_extendFrom8To32(b))) && ~bvsge32(b, 0bv32)) && ~bvsle32(a, 5bv32)) || ((((~bvsge32(a, 0bv32) && ~bvsle32(b, 5bv32)) && ~bvsge32(b, 1bv32)) && ~bvsge32(b, 0bv32)) && ~bvsle32(a, 5bv32)))) && ~bvsle32(b, 5bv32)) && ~bvsge32(b, 1bv32)) && ~bvsge32(b, 0bv32)) && (\exists ULTIMATE.start_main_~b~0#1 : bv32 :: ((~bvadd128(y, 1bv64) == ~bvsdiv64(~bvadd128(~sign_extendFrom8To32(ULTIMATE.start_main_~b~0#1), 18446744073709551615bv64), 2bv64) && ~bvsle32(ULTIMATE.start_main_~b~0#1, 5bv32)) && ~bvsge32(ULTIMATE.start_main_~b~0#1, 0bv32)) && 1bv64 == ~bvsrem64(~sign_extendFrom8To32(ULTIMATE.start_main_~b~0#1), 2bv64))) && ~bvadd128(z, ~bvmul64(x, y)) == ~bvmul64(~sign_extendFrom8To32(a), ~sign_extendFrom8To32(b))) && ~bvsle32(a, 5bv32))) || ((((((((((((((~bvsge32(a, 0bv32) && ~bvsle32(b, 5bv32)) && ~bvsge32(b, 1bv32)) && ~bvsge32(b, 0bv32)) && ~bvsle32(a, 5bv32)) && ~bvadd128(z, ~bvmul64(x, y)) == ~bvmul64(~sign_extendFrom8To32(a), ~sign_extendFrom8To32(b))) || ((((((~bvsge32(a, 0bv32) && ~bvsle32(b, 5bv32)) && ~bvsge32(b, 1bv32)) && z == ~bvmul64(~sign_extendFrom8To32(a), ~sign_extendFrom8To32(b))) && ~bvsge32(b, 0bv32)) && ~bvsle32(a, 5bv32)) && ~bvadd128(z, ~bvmul64(x, y)) == ~bvmul64(~sign_extendFrom8To32(a), ~sign_extendFrom8To32(b)))) && 0bv64 == y) && 1bv64 == ~bvsrem64(~bvadd128(y, 1bv64), 2bv64)) && ~bvsge32(a, 0bv32)) && ~bvsle32(b, 5bv32)) && ~bvsge32(b, 1bv32)) && ~bvsge32(b, 0bv32)) && (\exists ULTIMATE.start_main_~b~0#1 : bv32 :: ((~bvadd128(y, 1bv64) == ~bvsdiv64(~bvadd128(~sign_extendFrom8To32(ULTIMATE.start_main_~b~0#1), 18446744073709551615bv64), 2bv64) && ~bvsle32(ULTIMATE.start_main_~b~0#1, 5bv32)) && ~bvsge32(ULTIMATE.start_main_~b~0#1, 0bv32)) && 1bv64 == ~bvsrem64(~sign_extendFrom8To32(ULTIMATE.start_main_~b~0#1), 2bv64))) && ~bvsle32(a, 5bv32))) || ((((((((((\exists ULTIMATE.start_main_~b~0#1 : bv32 :: ((((y == ~bvsdiv64(~bvsdiv64(~bvadd128(~sign_extendFrom8To32(ULTIMATE.start_main_~b~0#1), 18446744073709551615bv64), 2bv64), 2bv64) && ~bvsle32(ULTIMATE.start_main_~b~0#1, 5bv32)) && !(0bv64 == ~bvsdiv64(~bvadd128(~sign_extendFrom8To32(ULTIMATE.start_main_~b~0#1), 18446744073709551615bv64), 2bv64))) && !(1bv64 == ~bvsrem64(~bvsdiv64(~bvadd128(~sign_extendFrom8To32(ULTIMATE.start_main_~b~0#1), 18446744073709551615bv64), 2bv64), 2bv64))) && ~bvsge32(ULTIMATE.start_main_~b~0#1, 0bv32)) && 1bv64 == ~bvsrem64(~sign_extendFrom8To32(ULTIMATE.start_main_~b~0#1), 2bv64)) && (\exists ULTIMATE.start_main_~b~0#1 : bv32 :: ((~bvsle32(ULTIMATE.start_main_~b~0#1, 5bv32) && ~bvsge32(ULTIMATE.start_main_~b~0#1, 0bv32)) && 1bv64 == ~bvsrem64(~sign_extendFrom8To32(ULTIMATE.start_main_~b~0#1), 2bv64)) && y == ~bvsdiv64(~bvadd128(~sign_extendFrom8To32(ULTIMATE.start_main_~b~0#1), 18446744073709551615bv64), 2bv64))) && 0bv64 == ~bvsdiv64(y, 2bv64)) && (~bvadd128(~bvadd128(z, x), ~bvmul64(~bvmul64(2bv64, x), ~bvsdiv64(~bvadd128(y, 18446744073709551615bv64), 2bv64))) == ~bvmul64(~sign_extendFrom8To32(a), ~sign_extendFrom8To32(b)) || !(1bv64 == ~bvsrem64(y, 2bv64)))) && ~bvsge32(a, 0bv32)) && ~bvsle32(b, 5bv32)) && ~bvsge32(b, 1bv32)) && ~bvsge32(b, 0bv32)) && ~bvsle32(a, 5bv32)) && ~bvadd128(z, ~bvmul64(x, y)) == ~bvmul64(~sign_extendFrom8To32(a), ~sign_extendFrom8To32(b)))) || ((((((((((((!(1bv64 == ~bvsrem64(~sign_extendFrom8To32(b), 2bv64)) && ~bvsge32(a, 0bv32)) && ((((((~bvsge32(a, 0bv32) && ~bvsle32(b, 5bv32)) && ~bvsge32(b, 1bv32)) && z == ~bvmul64(~sign_extendFrom8To32(a), ~sign_extendFrom8To32(b))) && ~bvsge32(b, 0bv32)) && ~bvsle32(a, 5bv32)) || ((((~bvsge32(a, 0bv32) && ~bvsle32(b, 5bv32)) && ~bvsge32(b, 1bv32)) && ~bvsge32(b, 0bv32)) && ~bvsle32(a, 5bv32)))) && y == ~bvsdiv64(~bvsdiv64(~sign_extendFrom8To32(b), 2bv64), 2bv64)) && x == ~bvmul64(2bv64, ~bvmul64(2bv64, ~sign_extendFrom8To32(a)))) && ~bvsge32(b, 1bv32)) && ~bvsle32(a, 5bv32)) && !(1bv64 == ~bvsrem64(~bvsdiv64(~sign_extendFrom8To32(b), 2bv64), 2bv64))) && (\exists ULTIMATE.start_main_~b~0#1 : bv32 :: ((~bvsle32(ULTIMATE.start_main_~b~0#1, 5bv32) && ~bvsge32(ULTIMATE.start_main_~b~0#1, 0bv32)) && 1bv64 == ~bvsrem64(~sign_extendFrom8To32(ULTIMATE.start_main_~b~0#1), 2bv64)) && y == ~bvsdiv64(~bvadd128(~sign_extendFrom8To32(ULTIMATE.start_main_~b~0#1), 18446744073709551615bv64), 2bv64))) && 0bv64 == ~bvsdiv64(y, 2bv64)) && ~bvsle32(b, 5bv32)) && z == 0bv64) && ~bvsge32(b, 0bv32))) || (((((((((((((z == ~sign_extendFrom8To32(a) && x == ~bvmul64(2bv64, z)) && ~bvsge32(a, 0bv32)) && ~bvsge32(b, 1bv32)) && 1bv64 == ~bvsrem64(~sign_extendFrom8To32(b), 2bv64)) && ~bvsle32(a, 5bv32)) && ~bvadd128(z, ~bvmul64(x, y)) == ~bvmul64(~sign_extendFrom8To32(a), ~sign_extendFrom8To32(b))) && (\exists ULTIMATE.start_main_~b~0#1 : bv32 :: ((~bvsle32(ULTIMATE.start_main_~b~0#1, 5bv32) && ~bvsge32(ULTIMATE.start_main_~b~0#1, 0bv32)) && 1bv64 == ~bvsrem64(~sign_extendFrom8To32(ULTIMATE.start_main_~b~0#1), 2bv64)) && y == ~bvsdiv64(~bvadd128(~sign_extendFrom8To32(ULTIMATE.start_main_~b~0#1), 18446744073709551615bv64), 2bv64))) && x == ~bvmul64(2bv64, ~sign_extendFrom8To32(a))) && ~bvadd128(~bvmul64(~sign_extendFrom8To32(a), 18446744073709551615bv64), z) == 0bv64) && ~bvsle32(b, 5bv32)) && ~bvsge32(b, 0bv32)) && 1bv64 == ~bvsrem64(~bvadd128(~bvadd128(~sign_extendFrom8To32(b), 18446744073709551615bv64), 1bv64), 2bv64)) && y == ~bvsdiv64(~bvadd128(~sign_extendFrom8To32(b), 18446744073709551615bv64), 2bv64)) RESULT: Ultimate proved your program to be correct! [2023-02-18 19:24:38,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE