./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound50.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_valuebound50.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 352373f9b097794e6947f5064b04543cec809ba042ac0b3a931e0e161838d7d3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-18 19:11:40,456 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 19:11:40,457 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 19:11:40,486 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 19:11:40,488 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 19:11:40,490 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 19:11:40,492 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 19:11:40,495 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 19:11:40,496 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 19:11:40,501 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 19:11:40,502 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 19:11:40,504 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 19:11:40,504 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 19:11:40,508 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 19:11:40,509 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 19:11:40,510 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 19:11:40,511 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 19:11:40,512 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 19:11:40,513 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 19:11:40,516 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 19:11:40,518 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 19:11:40,519 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 19:11:40,519 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 19:11:40,520 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 19:11:40,524 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 19:11:40,524 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 19:11:40,525 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 19:11:40,526 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 19:11:40,526 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 19:11:40,526 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 19:11:40,527 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 19:11:40,527 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 19:11:40,528 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 19:11:40,529 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 19:11:40,529 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 19:11:40,529 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 19:11:40,530 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 19:11:40,530 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 19:11:40,530 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 19:11:40,531 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 19:11:40,532 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 19:11:40,533 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:11:40,559 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 19:11:40,560 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 19:11:40,560 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 19:11:40,560 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 19:11:40,561 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 19:11:40,561 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 19:11:40,561 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 19:11:40,562 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 19:11:40,562 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 19:11:40,562 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 19:11:40,563 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 19:11:40,563 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 19:11:40,563 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 19:11:40,563 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 19:11:40,563 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 19:11:40,563 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 19:11:40,564 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 19:11:40,564 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 19:11:40,564 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 19:11:40,564 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 19:11:40,564 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 19:11:40,564 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 19:11:40,564 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 19:11:40,565 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 19:11:40,565 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 19:11:40,565 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 19:11:40,565 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 19:11:40,565 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 19:11:40,566 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 19:11:40,566 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 19:11:40,566 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 19:11:40,566 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 19:11:40,566 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 19:11:40,566 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 19:11:40,567 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 19:11:40,567 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 -> 352373f9b097794e6947f5064b04543cec809ba042ac0b3a931e0e161838d7d3 [2023-02-18 19:11:40,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 19:11:40,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 19:11:40,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 19:11:40,750 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 19:11:40,750 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 19:11:40,751 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound50.c [2023-02-18 19:11:41,813 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 19:11:41,960 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 19:11:41,960 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound50.c [2023-02-18 19:11:41,966 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a53c6eb84/42fbd7656b4241d79937a433f807fe4c/FLAGfa6d689ab [2023-02-18 19:11:42,378 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a53c6eb84/42fbd7656b4241d79937a433f807fe4c [2023-02-18 19:11:42,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 19:11:42,381 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 19:11:42,381 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 19:11:42,382 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 19:11:42,384 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 19:11:42,384 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 07:11:42" (1/1) ... [2023-02-18 19:11:42,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5433032f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:11:42, skipping insertion in model container [2023-02-18 19:11:42,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 07:11:42" (1/1) ... [2023-02-18 19:11:42,389 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 19:11:42,398 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 19:11:42,495 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_valuebound50.c[537,550] [2023-02-18 19:11:42,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 19:11:42,509 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 19:11:42,516 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_valuebound50.c[537,550] [2023-02-18 19:11:42,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 19:11:42,528 INFO L208 MainTranslator]: Completed translation [2023-02-18 19:11:42,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:11:42 WrapperNode [2023-02-18 19:11:42,529 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 19:11:42,529 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 19:11:42,530 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 19:11:42,530 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 19:11:42,534 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:11:42" (1/1) ... [2023-02-18 19:11:42,538 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:11:42" (1/1) ... [2023-02-18 19:11:42,548 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2023-02-18 19:11:42,548 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 19:11:42,548 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 19:11:42,548 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 19:11:42,549 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 19:11:42,553 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:11:42" (1/1) ... [2023-02-18 19:11:42,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:11:42" (1/1) ... [2023-02-18 19:11:42,554 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:11:42" (1/1) ... [2023-02-18 19:11:42,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:11:42" (1/1) ... [2023-02-18 19:11:42,556 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:11:42" (1/1) ... [2023-02-18 19:11:42,558 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:11:42" (1/1) ... [2023-02-18 19:11:42,558 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:11:42" (1/1) ... [2023-02-18 19:11:42,559 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:11:42" (1/1) ... [2023-02-18 19:11:42,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 19:11:42,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 19:11:42,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 19:11:42,560 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 19:11:42,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:11:42" (1/1) ... [2023-02-18 19:11:42,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 19:11:42,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:11:42,589 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:11:42,593 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:11:42,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 19:11:42,630 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-18 19:11:42,630 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-18 19:11:42,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 19:11:42,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 19:11:42,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 19:11:42,631 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 19:11:42,631 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 19:11:42,673 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 19:11:42,676 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 19:11:42,809 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 19:11:42,814 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 19:11:42,828 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-18 19:11:42,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:11:42 BoogieIcfgContainer [2023-02-18 19:11:42,830 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 19:11:42,832 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 19:11:42,832 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 19:11:42,834 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 19:11:42,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 07:11:42" (1/3) ... [2023-02-18 19:11:42,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@302f410d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 07:11:42, skipping insertion in model container [2023-02-18 19:11:42,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:11:42" (2/3) ... [2023-02-18 19:11:42,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@302f410d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 07:11:42, skipping insertion in model container [2023-02-18 19:11:42,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:11:42" (3/3) ... [2023-02-18 19:11:42,836 INFO L112 eAbstractionObserver]: Analyzing ICFG prodbin-ll_valuebound50.c [2023-02-18 19:11:42,864 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 19:11:42,864 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 19:11:42,912 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 19:11:42,919 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;@19dc73c8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 19:11:42,919 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 19:11:42,925 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:11:42,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-18 19:11:42,930 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:11:42,930 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:11:42,931 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:11:42,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:11:42,943 INFO L85 PathProgramCache]: Analyzing trace with hash -861605892, now seen corresponding path program 1 times [2023-02-18 19:11:42,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:11:42,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180265685] [2023-02-18 19:11:42,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:11:42,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:11:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:11:43,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:11:43,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180265685] [2023-02-18 19:11:43,023 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-18 19:11:43,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956973983] [2023-02-18 19:11:43,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:11:43,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:11:43,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:11:43,027 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:11:43,028 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:11:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:11:43,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-18 19:11:43,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:11:43,099 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:11:43,099 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 19:11:43,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956973983] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 19:11:43,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 19:11:43,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 19:11:43,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495099048] [2023-02-18 19:11:43,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 19:11:43,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 19:11:43,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:11:43,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 19:11:43,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 19:11:43,123 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:11:43,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:11:43,136 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2023-02-18 19:11:43,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 19:11:43,137 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:11:43,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:11:43,153 INFO L225 Difference]: With dead ends: 51 [2023-02-18 19:11:43,154 INFO L226 Difference]: Without dead ends: 23 [2023-02-18 19:11:43,156 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:11:43,158 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:11:43,159 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:11:43,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-18 19:11:43,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-18 19:11:43,180 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:11:43,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-02-18 19:11:43,182 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 24 [2023-02-18 19:11:43,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:11:43,182 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-02-18 19:11:43,182 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:11:43,182 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-02-18 19:11:43,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-18 19:11:43,183 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:11:43,184 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:11:43,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-18 19:11:43,394 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:11:43,396 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:11:43,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:11:43,396 INFO L85 PathProgramCache]: Analyzing trace with hash -2010313222, now seen corresponding path program 1 times [2023-02-18 19:11:43,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:11:43,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535594651] [2023-02-18 19:11:43,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:11:43,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:11:43,418 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 19:11:43,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1089353485] [2023-02-18 19:11:43,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:11:43,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:11:43,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:11:43,424 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:11:43,426 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:11:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:11:43,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 19:11:43,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:11:43,566 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:11:43,568 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 19:11:43,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:11:43,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535594651] [2023-02-18 19:11:43,569 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 19:11:43,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089353485] [2023-02-18 19:11:43,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089353485] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 19:11:43,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 19:11:43,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-18 19:11:43,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658085561] [2023-02-18 19:11:43,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 19:11:43,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 19:11:43,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:11:43,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 19:11:43,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-18 19:11:43,575 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:11:43,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:11:43,667 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2023-02-18 19:11:43,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 19:11:43,667 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:11:43,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:11:43,668 INFO L225 Difference]: With dead ends: 39 [2023-02-18 19:11:43,668 INFO L226 Difference]: Without dead ends: 32 [2023-02-18 19:11:43,669 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:11:43,669 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:11:43,670 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:11:43,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-18 19:11:43,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2023-02-18 19:11:43,674 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:11:43,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2023-02-18 19:11:43,675 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 24 [2023-02-18 19:11:43,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:11:43,676 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2023-02-18 19:11:43,676 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:11:43,676 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2023-02-18 19:11:43,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-18 19:11:43,677 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:11:43,677 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:11:43,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-18 19:11:43,881 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:11:43,882 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:11:43,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:11:43,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1371702355, now seen corresponding path program 1 times [2023-02-18 19:11:43,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:11:43,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384440592] [2023-02-18 19:11:43,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:11:43,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:11:43,908 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 19:11:43,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1079270656] [2023-02-18 19:11:43,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:11:43,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:11:43,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:11:43,915 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:11:43,917 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:11:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:11:43,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-18 19:11:43,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:11:44,073 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:11:44,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:11:45,744 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:11:45,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:11:45,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384440592] [2023-02-18 19:11:45,745 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 19:11:45,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079270656] [2023-02-18 19:11:45,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079270656] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 19:11:45,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 19:11:45,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2023-02-18 19:11:45,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363892164] [2023-02-18 19:11:45,745 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 19:11:45,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-18 19:11:45,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:11:45,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-18 19:11:45,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2023-02-18 19:11:45,749 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 15 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:11:47,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:11:47,986 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2023-02-18 19:11:47,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-18 19:11:47,987 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 15 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:11:47,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:11:47,988 INFO L225 Difference]: With dead ends: 48 [2023-02-18 19:11:47,988 INFO L226 Difference]: Without dead ends: 46 [2023-02-18 19:11:47,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2023-02-18 19:11:47,989 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 36 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-18 19:11:47,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 99 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-18 19:11:47,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-02-18 19:11:47,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2023-02-18 19:11:47,996 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:11:47,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2023-02-18 19:11:47,996 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 33 [2023-02-18 19:11:47,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:11:47,997 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2023-02-18 19:11:47,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 15 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:11:47,997 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2023-02-18 19:11:47,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-18 19:11:47,998 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:11:47,998 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:11:48,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-18 19:11:48,203 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:11:48,203 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:11:48,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:11:48,204 INFO L85 PathProgramCache]: Analyzing trace with hash 685673296, now seen corresponding path program 1 times [2023-02-18 19:11:48,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:11:48,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546177782] [2023-02-18 19:11:48,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:11:48,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:11:48,214 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 19:11:48,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [805626055] [2023-02-18 19:11:48,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:11:48,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:11:48,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:11:48,217 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:11:48,219 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:11:48,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:11:48,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-18 19:11:48,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:11:48,294 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:11:48,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:11:48,337 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:11:48,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:11:48,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546177782] [2023-02-18 19:11:48,339 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 19:11:48,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805626055] [2023-02-18 19:11:48,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805626055] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 19:11:48,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 19:11:48,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-18 19:11:48,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751984203] [2023-02-18 19:11:48,340 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 19:11:48,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 19:11:48,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:11:48,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 19:11:48,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-02-18 19:11:48,341 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:11:48,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:11:48,497 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2023-02-18 19:11:48,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 19:11:48,498 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:11:48,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:11:48,499 INFO L225 Difference]: With dead ends: 50 [2023-02-18 19:11:48,499 INFO L226 Difference]: Without dead ends: 43 [2023-02-18 19:11:48,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2023-02-18 19:11:48,499 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 19:11:48,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 139 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 19:11:48,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-02-18 19:11:48,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2023-02-18 19:11:48,504 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:11:48,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2023-02-18 19:11:48,505 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 39 [2023-02-18 19:11:48,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:11:48,505 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2023-02-18 19:11:48,505 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:11:48,505 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2023-02-18 19:11:48,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-18 19:11:48,506 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:11:48,506 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:11:48,522 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:11:48,706 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:11:48,707 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:11:48,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:11:48,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1683883622, now seen corresponding path program 1 times [2023-02-18 19:11:48,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:11:48,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665853146] [2023-02-18 19:11:48,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:11:48,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:11:48,722 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 19:11:48,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1612192248] [2023-02-18 19:11:48,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:11:48,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:11:48,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:11:48,729 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:11:48,755 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:11:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:11:48,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-18 19:11:48,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:11:50,362 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 19:11:50,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:12:12,568 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 19:12:12,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:12:12,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665853146] [2023-02-18 19:12:12,569 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 19:12:12,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612192248] [2023-02-18 19:12:12,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612192248] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 19:12:12,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 19:12:12,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 23 [2023-02-18 19:12:12,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094687264] [2023-02-18 19:12:12,569 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 19:12:12,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-18 19:12:12,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:12:12,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-18 19:12:12,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=417, Unknown=1, NotChecked=0, Total=506 [2023-02-18 19:12:12,571 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 20 states have internal predecessors, (44), 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:13,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-02-18 19:12:16,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 19:12:19,891 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:27,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2023-02-18 19:12:37,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 19:12:40,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 19:12:40,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:12:40,793 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2023-02-18 19:12:40,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-18 19:12:40,793 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 20 states have internal predecessors, (44), 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:40,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:12:40,794 INFO L225 Difference]: With dead ends: 82 [2023-02-18 19:12:40,794 INFO L226 Difference]: Without dead ends: 80 [2023-02-18 19:12:40,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 32.9s TimeCoverageRelationStatistics Valid=202, Invalid=852, Unknown=2, NotChecked=0, Total=1056 [2023-02-18 19:12:40,795 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 26 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 34 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.5s IncrementalHoareTripleChecker+Time [2023-02-18 19:12:40,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 133 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 420 Invalid, 1 Unknown, 0 Unchecked, 16.5s Time] [2023-02-18 19:12:40,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-18 19:12:40,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2023-02-18 19:12:40,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 62 states have internal predecessors, (66), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 10 states have call predecessors, (14), 14 states have call successors, (14) [2023-02-18 19:12:40,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 94 transitions. [2023-02-18 19:12:40,810 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 94 transitions. Word has length 42 [2023-02-18 19:12:40,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:12:40,810 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 94 transitions. [2023-02-18 19:12:40,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 20 states have internal predecessors, (44), 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:40,810 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2023-02-18 19:12:40,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-18 19:12:40,811 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:12:40,812 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:40,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-18 19:12:41,014 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:41,014 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:12:41,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:12:41,015 INFO L85 PathProgramCache]: Analyzing trace with hash -196098865, now seen corresponding path program 1 times [2023-02-18 19:12:41,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:12:41,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070602621] [2023-02-18 19:12:41,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:12:41,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:12:41,024 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 19:12:41,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [251003025] [2023-02-18 19:12:41,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:12:41,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:12:41,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:12:41,031 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:41,032 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:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:12:41,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-18 19:12:41,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:12:41,493 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 19:12:41,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:12:46,953 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~y~0#1| 2))) (or (and (< |c_ULTIMATE.start_main_~y~0#1| 0) (not (= 0 .cse0))) (let ((.cse20 (+ |c_ULTIMATE.start_main_~y~0#1| (- 1))) (.cse13 (* 2 |c_ULTIMATE.start_main_~x~0#1|))) (let ((.cse7 (* 2 .cse13)) (.cse9 (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|)) (.cse4 (= 0 (mod (+ |c_ULTIMATE.start_main_~y~0#1| 1) 2))) (.cse5 (< .cse20 0)) (.cse14 (div .cse20 2))) (and (let ((.cse12 (+ 1 .cse14)) (.cse11 (+ .cse14 1))) (let ((.cse1 (mod .cse11 2)) (.cse10 (< .cse12 0))) (let ((.cse3 (not .cse10)) (.cse2 (= 0 .cse1))) (or (and (= 1 .cse1) (or .cse2 .cse3)) .cse4 (not .cse5) (let ((.cse6 (+ (* (- 1) .cse12 .cse13) .cse9)) (.cse8 (div .cse11 2))) (and (or (= (+ .cse6 (* .cse7 (+ 1 .cse8))) .cse9) .cse2 .cse3) (or (and .cse10 (not .cse2)) (= (+ .cse6 (* .cse7 .cse8)) .cse9)))))))) (let ((.cse17 (< .cse14 0)) (.cse21 (mod .cse14 2))) (let ((.cse18 (= 0 .cse21)) (.cse19 (not .cse17))) (or (let ((.cse15 (+ (* (- 1) .cse14 .cse13) .cse9)) (.cse16 (div .cse20 4))) (and (or (= (+ .cse15 (* .cse7 .cse16)) .cse9) (and .cse17 (not .cse18))) (or .cse18 .cse19 (= (+ .cse15 (* .cse7 (+ 1 .cse16))) .cse9)))) (and (or .cse18 .cse19) (= 1 .cse21)) (and (not .cse4) .cse5))))))) (not (= 1 .cse0)))) is different from true [2023-02-18 19:12:48,182 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 1 not checked. [2023-02-18 19:12:48,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:12:48,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070602621] [2023-02-18 19:12:48,182 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 19:12:48,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251003025] [2023-02-18 19:12:48,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251003025] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 19:12:48,183 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 19:12:48,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 26 [2023-02-18 19:12:48,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082779949] [2023-02-18 19:12:48,183 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 19:12:48,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-18 19:12:48,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 19:12:48,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-18 19:12:48,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=510, Unknown=1, NotChecked=46, Total=650 [2023-02-18 19:12:48,184 INFO L87 Difference]: Start difference. First operand 79 states and 94 transitions. Second operand has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 24 states have internal predecessors, (49), 8 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2023-02-18 19:12:58,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-18 19:13:11,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:13:11,656 INFO L93 Difference]: Finished difference Result 120 states and 145 transitions. [2023-02-18 19:13:11,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-18 19:13:11,657 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 24 states have internal predecessors, (49), 8 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 51 [2023-02-18 19:13:11,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:13:11,658 INFO L225 Difference]: With dead ends: 120 [2023-02-18 19:13:11,658 INFO L226 Difference]: Without dead ends: 118 [2023-02-18 19:13:11,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 74 SyntacticMatches, 7 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 23.7s TimeCoverageRelationStatistics Valid=340, Invalid=1552, Unknown=4, NotChecked=84, Total=1980 [2023-02-18 19:13:11,660 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 63 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2023-02-18 19:13:11,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 154 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 556 Invalid, 0 Unknown, 56 Unchecked, 6.4s Time] [2023-02-18 19:13:11,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-02-18 19:13:11,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2023-02-18 19:13:11,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 88 states have (on average 1.1477272727272727) internal successors, (101), 94 states have internal predecessors, (101), 21 states have call successors, (21), 8 states have call predecessors, (21), 8 states have return successors, (21), 15 states have call predecessors, (21), 21 states have call successors, (21) [2023-02-18 19:13:11,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 143 transitions. [2023-02-18 19:13:11,684 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 143 transitions. Word has length 51 [2023-02-18 19:13:11,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:13:11,684 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 143 transitions. [2023-02-18 19:13:11,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 24 states have internal predecessors, (49), 8 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2023-02-18 19:13:11,685 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 143 transitions. [2023-02-18 19:13:11,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-18 19:13:11,686 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:13:11,686 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:13:11,692 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:13:11,891 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:13:11,892 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:13:11,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:13:11,892 INFO L85 PathProgramCache]: Analyzing trace with hash 602841912, now seen corresponding path program 2 times [2023-02-18 19:13:11,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 19:13:11,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951104067] [2023-02-18 19:13:11,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:13:11,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 19:13:11,899 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-18 19:13:11,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [9224934] [2023-02-18 19:13:11,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 19:13:11,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 19:13:11,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:13:11,901 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:13:11,903 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:13:11,948 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 19:13:11,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 19:13:11,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 55 conjunts are in the unsatisfiable core [2023-02-18 19:13:11,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:14:32,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 19:14:32,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951104067] [2023-02-18 19:14:32,361 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-18 19:14:32,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9224934] [2023-02-18 19:14:32,361 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2023-02-18 19:14:32,371 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:32,565 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:32,566 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$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$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:32,569 INFO L158 Benchmark]: Toolchain (without parser) took 170188.47ms. Allocated memory was 132.1MB in the beginning and 648.0MB in the end (delta: 515.9MB). Free memory was 91.6MB in the beginning and 362.0MB in the end (delta: -270.4MB). Peak memory consumption was 381.3MB. Max. memory is 16.1GB. [2023-02-18 19:14:32,569 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 132.1MB. Free memory is still 71.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 19:14:32,570 INFO L158 Benchmark]: CACSL2BoogieTranslator took 147.54ms. Allocated memory is still 132.1MB. Free memory was 91.6MB in the beginning and 81.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 19:14:32,570 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.42ms. Allocated memory is still 132.1MB. Free memory was 81.1MB in the beginning and 79.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 19:14:32,570 INFO L158 Benchmark]: Boogie Preprocessor took 11.22ms. Allocated memory is still 132.1MB. Free memory was 79.6MB in the beginning and 78.6MB in the end (delta: 943.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 19:14:32,570 INFO L158 Benchmark]: RCFGBuilder took 270.55ms. Allocated memory is still 132.1MB. Free memory was 78.6MB in the beginning and 68.9MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-18 19:14:32,570 INFO L158 Benchmark]: TraceAbstraction took 169736.83ms. Allocated memory was 132.1MB in the beginning and 648.0MB in the end (delta: 515.9MB). Free memory was 68.1MB in the beginning and 362.0MB in the end (delta: -293.8MB). Peak memory consumption was 358.2MB. Max. memory is 16.1GB. [2023-02-18 19:14:32,571 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 71.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 147.54ms. Allocated memory is still 132.1MB. Free memory was 91.6MB in the beginning and 81.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.42ms. Allocated memory is still 132.1MB. Free memory was 81.1MB in the beginning and 79.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 11.22ms. Allocated memory is still 132.1MB. Free memory was 79.6MB in the beginning and 78.6MB in the end (delta: 943.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 270.55ms. Allocated memory is still 132.1MB. Free memory was 78.6MB in the beginning and 68.9MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 169736.83ms. Allocated memory was 132.1MB in the beginning and 648.0MB in the end (delta: 515.9MB). Free memory was 68.1MB in the beginning and 362.0MB in the end (delta: -293.8MB). Peak memory consumption was 358.2MB. 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:32,648 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_valuebound50.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 352373f9b097794e6947f5064b04543cec809ba042ac0b3a931e0e161838d7d3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-18 19:14:34,550 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 19:14:34,552 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 19:14:34,591 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 19:14:34,592 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 19:14:34,595 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 19:14:34,596 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 19:14:34,598 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 19:14:34,601 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 19:14:34,606 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 19:14:34,607 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 19:14:34,609 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 19:14:34,609 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 19:14:34,611 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 19:14:34,612 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 19:14:34,615 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 19:14:34,616 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 19:14:34,617 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 19:14:34,618 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 19:14:34,621 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 19:14:34,623 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 19:14:34,623 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 19:14:34,624 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 19:14:34,625 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 19:14:34,630 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 19:14:34,631 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 19:14:34,631 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 19:14:34,632 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 19:14:34,633 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 19:14:34,633 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 19:14:34,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 19:14:34,638 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 19:14:34,639 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 19:14:34,639 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 19:14:34,640 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 19:14:34,641 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 19:14:34,641 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 19:14:34,641 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 19:14:34,641 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 19:14:34,642 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 19:14:34,642 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 19:14:34,643 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:34,663 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 19:14:34,663 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 19:14:34,664 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 19:14:34,664 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 19:14:34,665 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 19:14:34,665 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 19:14:34,665 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 19:14:34,666 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 19:14:34,666 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 19:14:34,666 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 19:14:34,667 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 19:14:34,667 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 19:14:34,667 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 19:14:34,667 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 19:14:34,667 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 19:14:34,667 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 19:14:34,667 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-18 19:14:34,668 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-18 19:14:34,668 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-18 19:14:34,668 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 19:14:34,668 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 19:14:34,668 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 19:14:34,668 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 19:14:34,669 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 19:14:34,669 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 19:14:34,669 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 19:14:34,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 19:14:34,669 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 19:14:34,669 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 19:14:34,670 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 19:14:34,670 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-18 19:14:34,670 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-18 19:14:34,670 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 19:14:34,670 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 19:14:34,670 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 19:14:34,670 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 19:14:34,671 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-18 19:14:34,671 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 19:14:34,671 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 -> 352373f9b097794e6947f5064b04543cec809ba042ac0b3a931e0e161838d7d3 [2023-02-18 19:14:34,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 19:14:34,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 19:14:34,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 19:14:34,917 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 19:14:34,918 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 19:14:34,919 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound50.c [2023-02-18 19:14:35,999 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 19:14:36,164 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 19:14:36,165 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound50.c [2023-02-18 19:14:36,178 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67d48c0c0/fb32907c760a47d8bbd66bb22428fcf5/FLAG9a71af627 [2023-02-18 19:14:36,192 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67d48c0c0/fb32907c760a47d8bbd66bb22428fcf5 [2023-02-18 19:14:36,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 19:14:36,195 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 19:14:36,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 19:14:36,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 19:14:36,200 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 19:14:36,201 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 07:14:36" (1/1) ... [2023-02-18 19:14:36,203 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13bd668b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:14:36, skipping insertion in model container [2023-02-18 19:14:36,203 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 07:14:36" (1/1) ... [2023-02-18 19:14:36,209 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 19:14:36,224 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 19:14:36,313 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_valuebound50.c[537,550] [2023-02-18 19:14:36,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 19:14:36,331 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 19:14:36,339 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_valuebound50.c[537,550] [2023-02-18 19:14:36,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 19:14:36,362 INFO L208 MainTranslator]: Completed translation [2023-02-18 19:14:36,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:14:36 WrapperNode [2023-02-18 19:14:36,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 19:14:36,364 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 19:14:36,364 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 19:14:36,364 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 19:14:36,369 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:36" (1/1) ... [2023-02-18 19:14:36,376 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:36" (1/1) ... [2023-02-18 19:14:36,388 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 40 [2023-02-18 19:14:36,389 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 19:14:36,390 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 19:14:36,390 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 19:14:36,390 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 19:14:36,396 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:36" (1/1) ... [2023-02-18 19:14:36,396 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:36" (1/1) ... [2023-02-18 19:14:36,405 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:36" (1/1) ... [2023-02-18 19:14:36,405 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:36" (1/1) ... [2023-02-18 19:14:36,417 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:36" (1/1) ... [2023-02-18 19:14:36,419 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:36" (1/1) ... [2023-02-18 19:14:36,422 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:36" (1/1) ... [2023-02-18 19:14:36,423 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:36" (1/1) ... [2023-02-18 19:14:36,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 19:14:36,427 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 19:14:36,427 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 19:14:36,427 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 19:14:36,428 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:14:36" (1/1) ... [2023-02-18 19:14:36,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 19:14:36,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 19:14:36,461 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:36,470 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:36,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 19:14:36,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-18 19:14:36,493 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-18 19:14:36,493 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-18 19:14:36,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 19:14:36,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 19:14:36,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 19:14:36,494 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 19:14:36,543 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 19:14:36,547 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 19:14:36,823 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 19:14:36,827 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 19:14:36,827 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-18 19:14:36,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:14:36 BoogieIcfgContainer [2023-02-18 19:14:36,829 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 19:14:36,830 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 19:14:36,833 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 19:14:36,835 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 19:14:36,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 07:14:36" (1/3) ... [2023-02-18 19:14:36,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6909c4ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 07:14:36, skipping insertion in model container [2023-02-18 19:14:36,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:14:36" (2/3) ... [2023-02-18 19:14:36,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6909c4ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 07:14:36, skipping insertion in model container [2023-02-18 19:14:36,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:14:36" (3/3) ... [2023-02-18 19:14:36,840 INFO L112 eAbstractionObserver]: Analyzing ICFG prodbin-ll_valuebound50.c [2023-02-18 19:14:36,851 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 19:14:36,857 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 19:14:36,887 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 19:14:36,892 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;@d3358c7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 19:14:36,895 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 19:14:36,913 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:36,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-18 19:14:36,919 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:14:36,919 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:36,919 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:14:36,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:14:36,925 INFO L85 PathProgramCache]: Analyzing trace with hash -861605892, now seen corresponding path program 1 times [2023-02-18 19:14:36,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 19:14:36,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1890127889] [2023-02-18 19:14:36,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:14:36,934 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:36,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 19:14:36,937 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:36,978 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:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:14:37,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-18 19:14:37,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:14:37,087 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:37,087 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 19:14:37,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 19:14:37,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1890127889] [2023-02-18 19:14:37,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1890127889] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 19:14:37,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 19:14:37,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 19:14:37,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954990404] [2023-02-18 19:14:37,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 19:14:37,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 19:14:37,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 19:14:37,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 19:14:37,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 19:14:37,125 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:37,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:14:37,144 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2023-02-18 19:14:37,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 19:14:37,146 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:37,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:14:37,151 INFO L225 Difference]: With dead ends: 51 [2023-02-18 19:14:37,151 INFO L226 Difference]: Without dead ends: 23 [2023-02-18 19:14:37,154 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:37,156 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:37,157 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:37,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-18 19:14:37,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-18 19:14:37,181 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:37,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-02-18 19:14:37,183 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 24 [2023-02-18 19:14:37,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:14:37,183 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-02-18 19:14:37,184 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:37,184 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-02-18 19:14:37,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-18 19:14:37,185 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:14:37,185 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:37,194 INFO L552 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)] Ended with exit code 0 [2023-02-18 19:14:37,394 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:37,395 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:14:37,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:14:37,396 INFO L85 PathProgramCache]: Analyzing trace with hash -2010313222, now seen corresponding path program 1 times [2023-02-18 19:14:37,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 19:14:37,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [454678837] [2023-02-18 19:14:37,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:14:37,397 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:37,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 19:14:37,398 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:37,400 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:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:14:37,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-18 19:14:37,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:14:37,613 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 19:14:37,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:14:39,962 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:39,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 19:14:39,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [454678837] [2023-02-18 19:14:39,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [454678837] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-18 19:14:39,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 19:14:39,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-02-18 19:14:39,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144086226] [2023-02-18 19:14:39,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 19:14:39,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 19:14:39,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 19:14:39,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 19:14:39,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-02-18 19:14:39,965 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 19:14:44,744 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:14:46,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:14:46,865 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2023-02-18 19:14:46,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 19:14:46,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2023-02-18 19:14:46,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:14:46,882 INFO L225 Difference]: With dead ends: 35 [2023-02-18 19:14:46,882 INFO L226 Difference]: Without dead ends: 33 [2023-02-18 19:14:46,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-02-18 19:14:46,883 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 9 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2023-02-18 19:14:46,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 70 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 1 Unknown, 0 Unchecked, 6.7s Time] [2023-02-18 19:14:46,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-02-18 19:14:46,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2023-02-18 19:14:46,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-18 19:14:46,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2023-02-18 19:14:46,889 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 24 [2023-02-18 19:14:46,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:14:46,890 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2023-02-18 19:14:46,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 19:14:46,890 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2023-02-18 19:14:46,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-18 19:14:46,892 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:14:46,893 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:14:46,911 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:47,093 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:47,094 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:14:47,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:14:47,095 INFO L85 PathProgramCache]: Analyzing trace with hash -895979555, now seen corresponding path program 1 times [2023-02-18 19:14:47,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 19:14:47,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017701081] [2023-02-18 19:14:47,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:14:47,097 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:47,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 19:14:47,098 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:47,100 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:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:14:47,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 19:14:47,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:14:47,313 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 19:14:47,314 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 19:14:47,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 19:14:47,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2017701081] [2023-02-18 19:14:47,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2017701081] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 19:14:47,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 19:14:47,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 19:14:47,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858260215] [2023-02-18 19:14:47,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 19:14:47,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 19:14:47,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 19:14:47,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 19:14:47,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-18 19:14:47,316 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-18 19:14:48,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:14:48,136 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2023-02-18 19:14:48,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 19:14:48,137 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2023-02-18 19:14:48,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:14:48,137 INFO L225 Difference]: With dead ends: 39 [2023-02-18 19:14:48,137 INFO L226 Difference]: Without dead ends: 32 [2023-02-18 19:14:48,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-18 19:14:48,138 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-18 19:14:48,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 68 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-18 19:14:48,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-18 19:14:48,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2023-02-18 19:14:48,143 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:48,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2023-02-18 19:14:48,144 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 30 [2023-02-18 19:14:48,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:14:48,144 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2023-02-18 19:14:48,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-18 19:14:48,144 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2023-02-18 19:14:48,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-18 19:14:48,145 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:14:48,145 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:48,165 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:14:48,354 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:14:48,354 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:14:48,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:14:48,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1371702355, now seen corresponding path program 1 times [2023-02-18 19:14:48,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 19:14:48,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [496807573] [2023-02-18 19:14:48,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:14:48,356 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:48,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 19:14:48,358 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:14:48,359 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:14:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:14:48,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 19:14:48,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:14:51,224 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:51,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:15:17,385 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:19,464 WARN L859 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1| (_ BitVec 32))) (let ((.cse1 ((_ sign_extend 32) |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)))) (not (bvsge |ULTIMATE.start_main_~b~0#1| (_ bv0 32))) (not (bvsle |ULTIMATE.start_main_~b~0#1| (_ bv50 32)))))) is different from true [2023-02-18 19:15:19,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 19:15:19,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [496807573] [2023-02-18 19:15:19,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [496807573] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 19:15:19,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [366693781] [2023-02-18 19:15:19,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:15:19,465 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-18 19:15:19,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-18 19:15:19,514 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-18 19:15:19,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2023-02-18 19:15:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:15:19,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-18 19:15:19,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:15:22,938 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-18 19:15:22,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:15:25,529 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|) ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|)))) (or (not (= (bvadd |c_ULTIMATE.start_main_~z~0#1| (bvmul |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)) .cse0)) (not (= (_ bv1 64) (bvsrem |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64)))) (= (bvadd (bvadd |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~x~0#1|) (bvmul (bvmul (_ bv2 64) |c_ULTIMATE.start_main_~x~0#1|) (bvsdiv (bvadd |c_ULTIMATE.start_main_~y~0#1| (_ bv18446744073709551615 64)) (_ bv2 64)))) .cse0))) is different from true [2023-02-18 19:15:29,257 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|))) (or (not (= (_ bv1 64) (bvsrem .cse0 (_ bv2 64)))) (let ((.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|))) (= (bvadd (bvadd (bvadd (bvmul .cse0 .cse1) (bvmul (_ bv18446744073709551615 64) .cse0 .cse1)) .cse1) (bvmul (bvmul (_ bv2 64) .cse1) (bvsdiv (bvadd .cse0 (_ bv18446744073709551615 64)) (_ bv2 64)))) (bvmul .cse1 .cse0))))) is different from true [2023-02-18 19:15:31,303 WARN L859 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1| (_ BitVec 32))) (let ((.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~b~0#1|))) (or (let ((.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|))) (= (bvadd (bvadd (bvadd (bvmul .cse0 .cse1) (bvmul (_ bv18446744073709551615 64) .cse0 .cse1)) .cse1) (bvmul (bvmul (_ bv2 64) .cse1) (bvsdiv (bvadd .cse0 (_ bv18446744073709551615 64)) (_ bv2 64)))) (bvmul .cse1 .cse0))) (not (= (_ bv1 64) (bvsrem .cse0 (_ bv2 64)))) (not (bvsge |ULTIMATE.start_main_~b~0#1| (_ bv0 32))) (not (bvsle |ULTIMATE.start_main_~b~0#1| (_ bv50 32)))))) is different from true [2023-02-18 19:15:31,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [366693781] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 19:15:31,304 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 19:15:31,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 13 [2023-02-18 19:15:31,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100944797] [2023-02-18 19:15:31,304 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 19:15:31,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-18 19:15:31,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 19:15:31,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-18 19:15:31,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=258, Unknown=6, NotChecked=180, Total=506 [2023-02-18 19:15:31,305 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-18 19:15:38,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:15:38,376 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2023-02-18 19:15:38,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 19:15:38,424 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 33 [2023-02-18 19:15:38,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:15:38,425 INFO L225 Difference]: With dead ends: 45 [2023-02-18 19:15:38,425 INFO L226 Difference]: Without dead ends: 43 [2023-02-18 19:15:38,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 76 SyntacticMatches, 9 SemanticMatches, 24 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 43.3s TimeCoverageRelationStatistics Valid=81, Invalid=353, Unknown=6, NotChecked=210, Total=650 [2023-02-18 19:15:38,426 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 29 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-02-18 19:15:38,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 85 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2023-02-18 19:15:38,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-02-18 19:15:38,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2023-02-18 19:15:38,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 28 states have internal predecessors, (30), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-18 19:15:38,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2023-02-18 19:15:38,432 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 33 [2023-02-18 19:15:38,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:15:38,432 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2023-02-18 19:15:38,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-18 19:15:38,432 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2023-02-18 19:15:38,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-18 19:15:38,433 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:15:38,433 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:15:38,448 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:15:38,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2023-02-18 19:15:38,843 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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-18 19:15:38,843 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:15:38,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:15:38,844 INFO L85 PathProgramCache]: Analyzing trace with hash 403305007, now seen corresponding path program 1 times [2023-02-18 19:15:38,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 19:15:38,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895791854] [2023-02-18 19:15:38,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:15:38,844 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:15:38,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 19:15:38,846 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:15:38,848 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:15:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:15:39,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 19:15:39,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:15:41,676 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 19:15:41,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:16:33,152 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|))) (or (= (_ bv1 64) (bvsrem .cse0 (_ bv2 64))) (= (_ bv0 64) .cse0) (let ((.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|))) (= (bvadd (_ bv0 64) (bvmul (bvmul (_ bv2 64) .cse1) (bvsdiv .cse0 (_ bv2 64)))) (bvmul .cse1 .cse0))) (not (bvsge |c_ULTIMATE.start_main_~b~0#1| (_ bv1 32))))) is different from true [2023-02-18 19:16:37,245 WARN L859 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1| (_ BitVec 32))) (let ((.cse1 ((_ sign_extend 32) |ULTIMATE.start_main_~b~0#1|))) (or (not (bvsge |ULTIMATE.start_main_~b~0#1| (_ bv1 32))) (let ((.cse0 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|))) (= (bvadd (_ bv0 64) (bvmul (bvmul (_ bv2 64) .cse0) (bvsdiv .cse1 (_ bv2 64)))) (bvmul .cse0 .cse1))) (not (bvsge |ULTIMATE.start_main_~b~0#1| (_ bv0 32))) (= (_ bv0 64) .cse1) (= (_ bv1 64) (bvsrem .cse1 (_ bv2 64))) (not (bvsle |ULTIMATE.start_main_~b~0#1| (_ bv50 32)))))) is different from true [2023-02-18 19:16:37,246 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 19:16:37,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [895791854] [2023-02-18 19:16:37,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [895791854] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 19:16:37,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1809488470] [2023-02-18 19:16:37,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:16:37,246 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-18 19:16:37,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-18 19:16:37,247 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-18 19:16:37,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2023-02-18 19:16:37,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:16:37,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-18 19:16:37,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:16:43,723 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 19:16:43,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:17:14,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1809488470] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 19:17:14,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 19:17:14,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 14 [2023-02-18 19:17:14,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166969047] [2023-02-18 19:17:14,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 19:17:14,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 19:17:14,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 19:17:14,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 19:17:14,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=409, Unknown=14, NotChecked=86, Total=600 [2023-02-18 19:17:14,204 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 11 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-18 19:17:26,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:17:26,834 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2023-02-18 19:17:26,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-18 19:17:26,834 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 11 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 33 [2023-02-18 19:17:26,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:17:26,836 INFO L225 Difference]: With dead ends: 55 [2023-02-18 19:17:26,836 INFO L226 Difference]: Without dead ends: 48 [2023-02-18 19:17:26,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 70 SyntacticMatches, 13 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 101.6s TimeCoverageRelationStatistics Valid=111, Invalid=531, Unknown=16, NotChecked=98, Total=756 [2023-02-18 19:17:26,837 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 22 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-02-18 19:17:26,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 100 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-02-18 19:17:26,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-02-18 19:17:26,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2023-02-18 19:17:26,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.125) internal successors, (36), 34 states have internal predecessors, (36), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 19:17:26,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2023-02-18 19:17:26,843 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 33 [2023-02-18 19:17:26,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:17:26,844 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2023-02-18 19:17:26,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 11 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-18 19:17:26,844 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2023-02-18 19:17:26,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-18 19:17:26,845 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:17:26,845 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:26,854 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:17:27,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2023-02-18 19:17:27,250 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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-18 19:17:27,251 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:17:27,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:17:27,251 INFO L85 PathProgramCache]: Analyzing trace with hash 685673296, now seen corresponding path program 1 times [2023-02-18 19:17:27,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 19:17:27,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1693528476] [2023-02-18 19:17:27,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:17:27,252 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:27,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 19:17:27,253 INFO L229 MonitoredProcess]: Starting monitored process 9 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:27,254 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 (9)] Waiting until timeout for monitored process [2023-02-18 19:17:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:17:27,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-18 19:17:27,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:17:37,692 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:37,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:17:41,835 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:41,835 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 19:17:41,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1693528476] [2023-02-18 19:17:41,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1693528476] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 19:17:41,835 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 19:17:41,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7] total 19 [2023-02-18 19:17:41,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282585868] [2023-02-18 19:17:41,835 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 19:17:41,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-18 19:17:41,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 19:17:41,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-18 19:17:41,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2023-02-18 19:17:41,837 INFO L87 Difference]: Start difference. First operand 46 states and 51 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:17:59,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:17:59,976 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2023-02-18 19:17:59,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-18 19:17:59,983 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:17:59,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:17:59,983 INFO L225 Difference]: With dead ends: 57 [2023-02-18 19:17:59,983 INFO L226 Difference]: Without dead ends: 49 [2023-02-18 19:17:59,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 54 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2023-02-18 19:17:59,984 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 43 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2023-02-18 19:17:59,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 119 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 13.4s Time] [2023-02-18 19:17:59,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-02-18 19:17:59,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 37. [2023-02-18 19:17:59,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-18 19:17:59,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2023-02-18 19:17:59,995 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 39 [2023-02-18 19:17:59,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:17:59,995 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2023-02-18 19:17:59,995 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:17:59,995 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2023-02-18 19:17:59,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-18 19:17:59,996 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:17:59,997 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:00,016 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 (9)] Forceful destruction successful, exit code 0 [2023-02-18 19:18:00,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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:00,214 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:18:00,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:18:00,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1857144666, now seen corresponding path program 2 times [2023-02-18 19:18:00,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 19:18:00,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1320549081] [2023-02-18 19:18:00,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 19:18:00,215 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:00,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 19:18:00,220 INFO L229 MonitoredProcess]: Starting monitored process 10 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:00,221 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 (10)] Waiting until timeout for monitored process [2023-02-18 19:18:00,564 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 19:18:00,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 19:18:00,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-18 19:18:00,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:18:23,841 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 19:18:23,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:19:00,863 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|) ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|)))) (or (not (= (bvadd |c_ULTIMATE.start_main_~z~0#1| (bvmul |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)) .cse0)) (not (= (_ bv1 64) (bvsrem |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64)))) (= (bvadd (bvadd |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~x~0#1|) (bvmul (bvmul (_ bv2 64) |c_ULTIMATE.start_main_~x~0#1|) (bvsdiv (bvadd |c_ULTIMATE.start_main_~y~0#1| (_ bv18446744073709551615 64)) (_ bv2 64)))) .cse0))) is different from true [2023-02-18 19:19:06,101 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv2 64) |c_ULTIMATE.start_main_~x~0#1|)) (.cse1 (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 (= (bvadd (bvadd |c_ULTIMATE.start_main_~z~0#1| .cse0) (bvmul (bvmul (_ bv2 64) .cse0) (bvsdiv (bvadd .cse1 (_ bv18446744073709551615 64)) (_ bv2 64)))) .cse2) (not (= (_ bv1 64) (bvsrem .cse1 (_ bv2 64)))) (not (= (bvadd |c_ULTIMATE.start_main_~z~0#1| (bvmul .cse0 .cse1)) .cse2)))) is different from true [2023-02-18 19:19:08,836 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~x~0#1|)) (.cse2 (bvmul (_ bv2 64) |c_ULTIMATE.start_main_~x~0#1|)) (.cse0 (bvsdiv (bvadd |c_ULTIMATE.start_main_~y~0#1| (_ bv18446744073709551615 64)) (_ bv2 64))) (.cse3 (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|) ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|)))) (or (not (= (_ bv1 64) (bvsrem .cse0 (_ bv2 64)))) (= (bvadd (bvadd .cse1 .cse2) (bvmul (bvmul (_ bv2 64) .cse2) (bvsdiv (bvadd .cse0 (_ bv18446744073709551615 64)) (_ bv2 64)))) .cse3) (not (= (_ bv1 64) (bvsrem |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64)))) (not (= (bvadd .cse1 (bvmul .cse2 .cse0)) .cse3)))) is different from true [2023-02-18 19:19:11,321 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|)) (.cse5 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|))) (let ((.cse0 (bvadd (_ bv0 64) .cse5)) (.cse1 (bvmul (_ bv2 64) .cse5)) (.cse2 (bvsdiv (bvadd .cse4 (_ bv18446744073709551615 64)) (_ bv2 64))) (.cse3 (bvmul .cse5 .cse4))) (or (= (bvadd (bvadd .cse0 .cse1) (bvmul (bvmul (_ bv2 64) .cse1) (bvsdiv (bvadd .cse2 (_ bv18446744073709551615 64)) (_ bv2 64)))) .cse3) (not (= (_ bv1 64) (bvsrem .cse4 (_ bv2 64)))) (not (= (_ bv1 64) (bvsrem .cse2 (_ bv2 64)))) (not (= (bvadd .cse0 (bvmul .cse1 .cse2)) .cse3))))) is different from true [2023-02-18 19:19:13,409 WARN L859 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1| (_ BitVec 32))) (let ((.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~b~0#1|)) (.cse5 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|))) (let ((.cse1 (bvadd (_ bv0 64) .cse5)) (.cse2 (bvmul (_ bv2 64) .cse5)) (.cse3 (bvsdiv (bvadd .cse0 (_ bv18446744073709551615 64)) (_ bv2 64))) (.cse4 (bvmul .cse5 .cse0))) (or (not (= (_ bv1 64) (bvsrem .cse0 (_ bv2 64)))) (= (bvadd (bvadd .cse1 .cse2) (bvmul (bvmul (_ bv2 64) .cse2) (bvsdiv (bvadd .cse3 (_ bv18446744073709551615 64)) (_ bv2 64)))) .cse4) (not (bvsge |ULTIMATE.start_main_~b~0#1| (_ bv0 32))) (not (= (_ bv1 64) (bvsrem .cse3 (_ bv2 64)))) (not (= (bvadd .cse1 (bvmul .cse2 .cse3)) .cse4)) (not (bvsle |ULTIMATE.start_main_~b~0#1| (_ bv50 32))))))) is different from true [2023-02-18 19:19:13,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 19:19:13,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1320549081] [2023-02-18 19:19:13,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1320549081] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 19:19:13,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [770305400] [2023-02-18 19:19:13,410 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 19:19:13,410 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-18 19:19:13,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-18 19:19:13,412 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-18 19:19:13,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2023-02-18 19:19:13,819 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 19:19:13,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 19:19:13,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-18 19:19:13,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:19:30,315 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-18 19:19:30,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:19:33,599 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|)) (.cse3 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|)) (.cse2 (bvsdiv (bvadd |c_ULTIMATE.start_main_~y~0#1| (_ bv18446744073709551615 64)) (_ bv2 64)))) (let ((.cse0 (bvadd (bvmul .cse4 .cse3) (bvmul (_ bv18446744073709551614 64) |c_ULTIMATE.start_main_~x~0#1| .cse2)))) (or (= (let ((.cse1 (bvmul (_ bv2 64) |c_ULTIMATE.start_main_~x~0#1|))) (bvadd (bvadd .cse0 .cse1) (bvmul (bvmul (_ bv2 64) .cse1) (bvsdiv (bvadd .cse2 (_ bv18446744073709551615 64)) (_ bv2 64))))) (bvmul .cse3 .cse4)) (not (= (_ bv1 64) (bvsrem .cse2 (_ bv2 64)))) (not (= (_ bv1 64) (bvsrem |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64)))) (not (= .cse0 (bvadd |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~x~0#1|)))))) is different from true [2023-02-18 19:19:36,577 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (bvsdiv (bvadd |c_ULTIMATE.start_main_~y~0#1| (_ bv18446744073709551615 64)) (_ bv2 64))) (.cse5 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|)) (.cse4 ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse3 (bvmul .cse5 .cse4)) (.cse0 (bvadd (bvmul .cse4 .cse5) (bvmul (_ bv18446744073709551614 64) |c_ULTIMATE.start_main_~x~0#1| .cse2)))) (or (= (let ((.cse1 (bvmul (_ bv2 64) |c_ULTIMATE.start_main_~x~0#1|))) (bvadd (bvadd .cse0 .cse1) (bvmul (bvmul (_ bv2 64) .cse1) (bvsdiv (bvadd .cse2 (_ bv18446744073709551615 64)) (_ bv2 64))))) .cse3) (not (= (bvadd |c_ULTIMATE.start_main_~z~0#1| (bvmul |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)) .cse3)) (not (= (_ bv1 64) (bvsrem .cse2 (_ bv2 64)))) (not (= (_ bv1 64) (bvsrem |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64)))) (not (= .cse0 (bvadd |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~x~0#1|)))))) is different from true [2023-02-18 19:19:42,908 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_27| (_ BitVec 64))) (let ((.cse3 (bvsdiv (bvadd |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_27| (_ bv18446744073709551615 64)) (_ bv2 64)))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_26| (_ BitVec 64)) (|v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_43| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_50| (_ BitVec 32))) (let ((.cse6 ((_ sign_extend 32) |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_43|)) (.cse5 ((_ sign_extend 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_50|))) (let ((.cse0 (bvmul .cse6 .cse5)) (.cse1 (bvmul (_ bv18446744073709551614 64) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_26| .cse3)) (.cse4 (bvmul .cse5 .cse6))) (or (= (let ((.cse2 (bvmul (_ bv2 64) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_26|))) (bvadd (bvadd (bvadd .cse0 .cse1) .cse2) (bvmul (bvmul (_ bv2 64) .cse2) (bvsdiv (bvadd .cse3 (_ bv18446744073709551615 64)) (_ bv2 64))))) .cse4) (= (bvadd (bvadd .cse0 (bvmul (_ bv18446744073709551615 64) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_26|) .cse1) (bvmul |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_27|)) .cse4))))) (not (= (_ bv1 64) (bvsrem |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_27| (_ bv2 64)))) (not (= (_ bv1 64) (bvsrem .cse3 (_ bv2 64))))))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2023-02-18 19:19:49,199 WARN L859 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c___VERIFIER_assert_~cond) (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_27| (_ BitVec 64))) (let ((.cse3 (bvsdiv (bvadd |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_27| (_ bv18446744073709551615 64)) (_ bv2 64)))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_26| (_ BitVec 64)) (|v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_43| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_50| (_ BitVec 32))) (let ((.cse6 ((_ sign_extend 32) |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_43|)) (.cse5 ((_ sign_extend 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_50|))) (let ((.cse0 (bvmul .cse6 .cse5)) (.cse1 (bvmul (_ bv18446744073709551614 64) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_26| .cse3)) (.cse4 (bvmul .cse5 .cse6))) (or (= (let ((.cse2 (bvmul (_ bv2 64) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_26|))) (bvadd (bvadd (bvadd .cse0 .cse1) .cse2) (bvmul (bvmul (_ bv2 64) .cse2) (bvsdiv (bvadd .cse3 (_ bv18446744073709551615 64)) (_ bv2 64))))) .cse4) (= (bvadd (bvadd .cse0 (bvmul (_ bv18446744073709551615 64) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_26|) .cse1) (bvmul |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_26| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_27|)) .cse4))))) (not (= (_ bv1 64) (bvsrem |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_27| (_ bv2 64)))) (not (= (_ bv1 64) (bvsrem .cse3 (_ bv2 64))))))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2023-02-18 19:19:53,843 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|)) (.cse5 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|))) (let ((.cse4 (bvmul .cse2 .cse5)) (.cse3 (bvsdiv (bvadd .cse2 (_ bv18446744073709551615 64)) (_ bv2 64)))) (let ((.cse1 (bvmul .cse5 .cse2)) (.cse0 (bvadd .cse4 (bvmul (_ bv18446744073709551615 64) .cse5) (bvmul (_ bv18446744073709551614 64) .cse3 .cse5)))) (or (not (= (bvadd .cse0 .cse1) .cse1)) (not (= (_ bv1 64) (bvsrem .cse2 (_ bv2 64)))) (not (= (_ bv1 64) (bvsrem .cse3 (_ bv2 64)))) (= (let ((.cse6 (bvmul (_ bv2 64) .cse5))) (bvadd (bvadd (bvadd .cse4 (bvmul (_ bv18446744073709551614 64) .cse5 .cse3)) .cse6) (bvmul (bvmul (_ bv2 64) .cse6) (bvsdiv (bvadd .cse3 (_ bv18446744073709551615 64)) (_ bv2 64))))) .cse1) (not (= .cse0 (_ bv0 64))))))) is different from true [2023-02-18 19:19:55,954 WARN L859 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1| (_ BitVec 32))) (let ((.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~b~0#1|)) (.cse4 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|))) (let ((.cse3 (bvmul .cse0 .cse4)) (.cse5 (bvsdiv (bvadd .cse0 (_ bv18446744073709551615 64)) (_ bv2 64)))) (let ((.cse2 (bvmul .cse4 .cse0)) (.cse1 (bvadd .cse3 (bvmul (_ bv18446744073709551615 64) .cse4) (bvmul (_ bv18446744073709551614 64) .cse5 .cse4)))) (or (not (= (_ bv1 64) (bvsrem .cse0 (_ bv2 64)))) (not (bvsge |ULTIMATE.start_main_~b~0#1| (_ bv0 32))) (not (= (bvadd .cse1 .cse2) .cse2)) (= (let ((.cse6 (bvmul (_ bv2 64) .cse4))) (bvadd (bvadd (bvadd .cse3 (bvmul (_ bv18446744073709551614 64) .cse4 .cse5)) .cse6) (bvmul (bvmul (_ bv2 64) .cse6) (bvsdiv (bvadd .cse5 (_ bv18446744073709551615 64)) (_ bv2 64))))) .cse2) (not (= (_ bv1 64) (bvsrem .cse5 (_ bv2 64)))) (not (= .cse1 (_ bv0 64))) (not (bvsle |ULTIMATE.start_main_~b~0#1| (_ bv50 32)))))))) is different from true [2023-02-18 19:19:55,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [770305400] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 19:19:55,955 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 19:19:55,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2023-02-18 19:19:55,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139896396] [2023-02-18 19:19:55,955 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 19:19:55,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 19:19:55,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 19:19:55,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 19:19:55,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=359, Unknown=12, NotChecked=528, Total=992 [2023-02-18 19:19:55,956 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 13 states have internal predecessors, (29), 6 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-18 19:20:06,446 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 [0] [2023-02-18 19:20:15,260 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 [0] [2023-02-18 19:20:26,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:20:26,503 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2023-02-18 19:20:26,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-18 19:20:26,611 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 13 states have internal predecessors, (29), 6 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2023-02-18 19:20:26,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:20:26,612 INFO L225 Difference]: With dead ends: 57 [2023-02-18 19:20:26,612 INFO L226 Difference]: Without dead ends: 55 [2023-02-18 19:20:26,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 96 SyntacticMatches, 17 SemanticMatches, 33 ConstructedPredicates, 11 IntricatePredicates, 1 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 104.0s TimeCoverageRelationStatistics Valid=113, Invalid=471, Unknown=12, NotChecked=594, Total=1190 [2023-02-18 19:20:26,613 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 29 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.3s IncrementalHoareTripleChecker+Time [2023-02-18 19:20:26,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 118 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 364 Invalid, 2 Unknown, 0 Unchecked, 25.3s Time] [2023-02-18 19:20:26,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-02-18 19:20:26,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2023-02-18 19:20:26,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 37 states have internal predecessors, (39), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-18 19:20:26,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2023-02-18 19:20:26,619 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 42 [2023-02-18 19:20:26,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:20:26,619 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2023-02-18 19:20:26,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 13 states have internal predecessors, (29), 6 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-18 19:20:26,620 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2023-02-18 19:20:26,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-18 19:20:26,620 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:20:26,620 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:20:26,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2023-02-18 19:20:26,841 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 (10)] Forceful destruction successful, exit code 0 [2023-02-18 19:20:27,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /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:20:27,035 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:20:27,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:20:27,036 INFO L85 PathProgramCache]: Analyzing trace with hash -662815268, now seen corresponding path program 1 times [2023-02-18 19:20:27,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 19:20:27,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751213027] [2023-02-18 19:20:27,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:20:27,036 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:20:27,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 19:20:27,037 INFO L229 MonitoredProcess]: Starting monitored process 12 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:20:27,039 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 (12)] Waiting until timeout for monitored process [2023-02-18 19:20:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:20:27,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-18 19:20:27,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:20:45,911 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 19:20:45,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:21:34,680 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|) ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|)))) (or (not (= (bvadd |c_ULTIMATE.start_main_~z~0#1| (bvmul |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)) .cse0)) (= (_ bv1 64) (bvsrem |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64))) (= (_ bv0 64) |c_ULTIMATE.start_main_~y~0#1|) (= (bvadd |c_ULTIMATE.start_main_~z~0#1| (bvmul (bvmul (_ bv2 64) |c_ULTIMATE.start_main_~x~0#1|) (bvsdiv |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64)))) .cse0))) is different from true [2023-02-18 19:22:23,779 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~x~0#1|)) (.cse2 (bvmul (_ bv2 64) |c_ULTIMATE.start_main_~x~0#1|)) (.cse3 (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|) ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|))) (.cse0 (bvsdiv (bvadd |c_ULTIMATE.start_main_~y~0#1| (_ bv18446744073709551615 64)) (_ bv2 64)))) (or (= (_ bv0 64) .cse0) (not (= (_ bv1 64) (bvsrem |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64)))) (not (= (bvadd .cse1 (bvmul .cse2 .cse0)) .cse3)) (= (bvadd .cse1 (bvmul (bvmul (_ bv2 64) .cse2) (bvsdiv .cse0 (_ bv2 64)))) .cse3) (= (_ bv1 64) (bvsrem .cse0 (_ bv2 64))))) is different from true [2023-02-18 19:22:26,470 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|)) (.cse5 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|))) (let ((.cse2 (bvadd (_ bv0 64) .cse5)) (.cse3 (bvmul (_ bv2 64) .cse5)) (.cse0 (bvsdiv (bvadd .cse1 (_ bv18446744073709551615 64)) (_ bv2 64))) (.cse4 (bvmul .cse5 .cse1))) (or (= (_ bv0 64) .cse0) (= (_ bv1 64) (bvsrem .cse0 (_ bv2 64))) (not (= (_ bv1 64) (bvsrem .cse1 (_ bv2 64)))) (= (bvadd .cse2 (bvmul (bvmul (_ bv2 64) .cse3) (bvsdiv .cse0 (_ bv2 64)))) .cse4) (not (= (bvadd .cse2 (bvmul .cse3 .cse0)) .cse4))))) is different from true [2023-02-18 19:22:28,551 WARN L859 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1| (_ BitVec 32))) (let ((.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~b~0#1|)) (.cse5 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|))) (let ((.cse2 (bvadd (_ bv0 64) .cse5)) (.cse3 (bvmul (_ bv2 64) .cse5)) (.cse4 (bvmul .cse5 .cse0)) (.cse1 (bvsdiv (bvadd .cse0 (_ bv18446744073709551615 64)) (_ bv2 64)))) (or (not (= (_ bv1 64) (bvsrem .cse0 (_ bv2 64)))) (not (bvsge |ULTIMATE.start_main_~b~0#1| (_ bv0 32))) (= (_ bv1 64) (bvsrem .cse1 (_ bv2 64))) (not (= (bvadd .cse2 (bvmul .cse3 .cse1)) .cse4)) (= (bvadd .cse2 (bvmul (bvmul (_ bv2 64) .cse3) (bvsdiv .cse1 (_ bv2 64)))) .cse4) (= (_ bv0 64) .cse1) (not (bvsle |ULTIMATE.start_main_~b~0#1| (_ bv50 32))))))) is different from true [2023-02-18 19:22:28,551 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 19:22:28,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751213027] [2023-02-18 19:22:28,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1751213027] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 19:22:28,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1787189310] [2023-02-18 19:22:28,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 19:22:28,552 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-18 19:22:28,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-18 19:22:28,555 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-18 19:22:28,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2023-02-18 19:22:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 19:22:28,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-18 19:22:28,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:22:40,992 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-18 19:22:40,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:22:43,818 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|)) (.cse2 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|)) (.cse1 (bvsdiv (bvadd |c_ULTIMATE.start_main_~y~0#1| (_ bv18446744073709551615 64)) (_ bv2 64)))) (let ((.cse0 (bvadd (bvmul .cse3 .cse2) (bvmul (_ bv18446744073709551614 64) |c_ULTIMATE.start_main_~x~0#1| .cse1)))) (or (= (bvadd .cse0 (bvmul (bvmul (_ bv2 64) (bvmul (_ bv2 64) |c_ULTIMATE.start_main_~x~0#1|)) (bvsdiv .cse1 (_ bv2 64)))) (bvmul .cse2 .cse3)) (= (_ bv0 64) .cse1) (not (= (_ bv1 64) (bvsrem |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64)))) (not (= .cse0 (bvadd |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~x~0#1|))) (= (_ bv1 64) (bvsrem .cse1 (_ bv2 64)))))) is different from true [2023-02-18 19:22:46,957 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (bvsdiv (bvadd |c_ULTIMATE.start_main_~y~0#1| (_ bv18446744073709551615 64)) (_ bv2 64))) (.cse4 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|)) (.cse3 ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse0 (bvmul .cse4 .cse3)) (.cse1 (bvadd (bvmul .cse3 .cse4) (bvmul (_ bv18446744073709551614 64) |c_ULTIMATE.start_main_~x~0#1| .cse2)))) (or (not (= (bvadd |c_ULTIMATE.start_main_~z~0#1| (bvmul |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)) .cse0)) (= (bvadd .cse1 (bvmul (bvmul (_ bv2 64) (bvmul (_ bv2 64) |c_ULTIMATE.start_main_~x~0#1|)) (bvsdiv .cse2 (_ bv2 64)))) .cse0) (= (_ bv0 64) .cse2) (not (= (_ bv1 64) (bvsrem |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64)))) (not (= .cse1 (bvadd |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~x~0#1|))) (= (_ bv1 64) (bvsrem .cse2 (_ bv2 64)))))) is different from true [2023-02-18 19:22:51,190 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_36| (_ BitVec 64)) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_37| (_ BitVec 64)) (|v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_57| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_66| (_ BitVec 32))) (let ((.cse0 (bvsdiv (bvadd |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_37| (_ bv18446744073709551615 64)) (_ bv2 64))) (.cse5 ((_ sign_extend 32) |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_57|)) (.cse4 ((_ sign_extend 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_66|))) (let ((.cse1 (bvmul .cse5 .cse4)) (.cse2 (bvmul (_ bv18446744073709551614 64) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_36| .cse0)) (.cse3 (bvmul .cse4 .cse5))) (or (= (_ bv1 64) (bvsrem .cse0 (_ bv2 64))) (not (= (_ bv1 64) (bvsrem |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_37| (_ bv2 64)))) (= (bvadd (bvadd .cse1 .cse2) (bvmul (bvmul (_ bv2 64) (bvmul (_ bv2 64) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_36|)) (bvsdiv .cse0 (_ bv2 64)))) .cse3) (= (_ bv0 64) .cse0) (= (bvadd (bvadd .cse1 .cse2 (bvmul (_ bv18446744073709551615 64) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_36|)) (bvmul |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_36| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_37|)) .cse3))))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2023-02-18 19:22:57,536 WARN L859 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c___VERIFIER_assert_~cond) (forall ((|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_36| (_ BitVec 64)) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_37| (_ BitVec 64)) (|v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_57| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_66| (_ BitVec 32))) (let ((.cse0 (bvsdiv (bvadd |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_37| (_ bv18446744073709551615 64)) (_ bv2 64))) (.cse5 ((_ sign_extend 32) |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_57|)) (.cse4 ((_ sign_extend 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_66|))) (let ((.cse1 (bvmul .cse5 .cse4)) (.cse2 (bvmul (_ bv18446744073709551614 64) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_36| .cse0)) (.cse3 (bvmul .cse4 .cse5))) (or (= (_ bv1 64) (bvsrem .cse0 (_ bv2 64))) (not (= (_ bv1 64) (bvsrem |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_37| (_ bv2 64)))) (= (bvadd (bvadd .cse1 .cse2) (bvmul (bvmul (_ bv2 64) (bvmul (_ bv2 64) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_36|)) (bvsdiv .cse0 (_ bv2 64)))) .cse3) (= (_ bv0 64) .cse0) (= (bvadd (bvadd .cse1 .cse2 (bvmul (_ bv18446744073709551615 64) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_36|)) (bvmul |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_36| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_37|)) .cse3))))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2023-02-18 19:23:02,171 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse3 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|)) (.cse0 (bvsdiv (bvadd .cse1 (_ bv18446744073709551615 64)) (_ bv2 64)))) (let ((.cse2 (bvadd (bvmul .cse1 .cse3) (bvmul (_ bv18446744073709551614 64) .cse3 .cse0)))) (or (= (_ bv0 64) .cse0) (= (_ bv1 64) (bvsrem .cse0 (_ bv2 64))) (not (= (_ bv1 64) (bvsrem .cse1 (_ bv2 64)))) (not (= .cse2 (bvadd (_ bv0 64) .cse3))) (= (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:23:04,237 WARN L859 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1| (_ BitVec 32))) (let ((.cse0 ((_ sign_extend 32) |ULTIMATE.start_main_~b~0#1|))) (let ((.cse2 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|)) (.cse3 (bvsdiv (bvadd .cse0 (_ bv18446744073709551615 64)) (_ bv2 64)))) (let ((.cse1 (bvadd (bvmul .cse0 .cse2) (bvmul (_ bv18446744073709551614 64) .cse2 .cse3)))) (or (not (= (_ bv1 64) (bvsrem .cse0 (_ bv2 64)))) (= (bvadd .cse1 (bvmul (bvmul (_ bv2 64) (bvmul (_ bv2 64) .cse2)) (bvsdiv .cse3 (_ bv2 64)))) (bvmul .cse2 .cse0)) (not (= .cse1 (bvadd (_ bv0 64) .cse2))) (not (bvsge |ULTIMATE.start_main_~b~0#1| (_ bv0 32))) (= (_ bv1 64) (bvsrem .cse3 (_ bv2 64))) (= (_ bv0 64) .cse3) (not (bvsle |ULTIMATE.start_main_~b~0#1| (_ bv50 32)))))))) is different from true [2023-02-18 19:23:04,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1787189310] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 19:23:04,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 19:23:04,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2023-02-18 19:23:04,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192704673] [2023-02-18 19:23:04,238 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 19:23:04,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 19:23:04,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 19:23:04,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 19:23:04,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=411, Unknown=22, NotChecked=510, Total=1056 [2023-02-18 19:23:04,239 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 14 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-18 19:23:16,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 19:23:36,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 19:23:36,061 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2023-02-18 19:23:36,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-18 19:23:36,170 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 14 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2023-02-18 19:23:36,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 19:23:36,170 INFO L225 Difference]: With dead ends: 65 [2023-02-18 19:23:36,170 INFO L226 Difference]: Without dead ends: 63 [2023-02-18 19:23:36,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 95 SyntacticMatches, 16 SemanticMatches, 34 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 156.9s TimeCoverageRelationStatistics Valid=132, Invalid=533, Unknown=25, NotChecked=570, Total=1260 [2023-02-18 19:23:36,171 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.5s IncrementalHoareTripleChecker+Time [2023-02-18 19:23:36,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 110 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 20.5s Time] [2023-02-18 19:23:36,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-02-18 19:23:36,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 46. [2023-02-18 19:23:36,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-18 19:23:36,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2023-02-18 19:23:36,179 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 42 [2023-02-18 19:23:36,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 19:23:36,179 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2023-02-18 19:23:36,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 14 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-18 19:23:36,179 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2023-02-18 19:23:36,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-18 19:23:36,182 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 19:23:36,182 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 19:23:36,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2023-02-18 19:23:36,400 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 (12)] Forceful destruction successful, exit code 0 [2023-02-18 19:23:36,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,12 /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:36,589 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 19:23:36,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 19:23:36,589 INFO L85 PathProgramCache]: Analyzing trace with hash 836076312, now seen corresponding path program 2 times [2023-02-18 19:23:36,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 19:23:36,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1376852061] [2023-02-18 19:23:36,589 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 19:23:36,589 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:36,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 19:23:36,591 INFO L229 MonitoredProcess]: Starting monitored process 14 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:36,592 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 (14)] Waiting until timeout for monitored process [2023-02-18 19:23:36,900 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 19:23:36,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 19:23:36,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-18 19:23:36,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:24:02,222 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-18 19:24:02,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:24:51,861 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|) ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|)))) (or (not (= (bvadd |c_ULTIMATE.start_main_~z~0#1| (bvmul |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)) .cse0)) (not (= (_ bv1 64) (bvsrem |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64)))) (= (bvadd (bvadd |c_ULTIMATE.start_main_~z~0#1| |c_ULTIMATE.start_main_~x~0#1|) (bvmul (bvmul (_ bv2 64) |c_ULTIMATE.start_main_~x~0#1|) (bvsdiv (bvadd |c_ULTIMATE.start_main_~y~0#1| (_ bv18446744073709551615 64)) (_ bv2 64)))) .cse0))) is different from true [2023-02-18 19:24:57,764 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv2 64) |c_ULTIMATE.start_main_~x~0#1|)) (.cse1 (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 (= (bvadd (bvadd |c_ULTIMATE.start_main_~z~0#1| .cse0) (bvmul (bvmul (_ bv2 64) .cse0) (bvsdiv (bvadd .cse1 (_ bv18446744073709551615 64)) (_ bv2 64)))) .cse2) (not (= (_ bv1 64) (bvsrem .cse1 (_ bv2 64)))) (not (= (bvadd |c_ULTIMATE.start_main_~z~0#1| (bvmul .cse0 .cse1)) .cse2)))) is different from true [2023-02-18 19:25:00,359 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv2 64) |c_ULTIMATE.start_main_~x~0#1|)) (.cse1 (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 (= (bvadd (bvadd |c_ULTIMATE.start_main_~z~0#1| .cse0) (bvmul (bvmul (_ bv2 64) .cse0) (bvsdiv (bvadd .cse1 (_ bv18446744073709551615 64)) (_ bv2 64)))) .cse2) (= (_ bv1 64) (bvsrem |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64))) (not (= (_ bv1 64) (bvsrem .cse1 (_ bv2 64)))) (not (= (bvadd |c_ULTIMATE.start_main_~z~0#1| (bvmul .cse0 .cse1)) .cse2)))) is different from true [2023-02-18 19:25:02,903 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|)) (.cse4 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|))) (let ((.cse2 (bvmul (_ bv2 64) .cse4)) (.cse0 (bvsdiv .cse1 (_ bv2 64))) (.cse3 (bvmul .cse4 .cse1))) (or (not (= (_ bv1 64) (bvsrem .cse0 (_ bv2 64)))) (= (_ bv1 64) (bvsrem .cse1 (_ bv2 64))) (not (= (bvadd (_ bv0 64) (bvmul .cse2 .cse0)) .cse3)) (= (bvadd (bvadd (_ bv0 64) .cse2) (bvmul (bvmul (_ bv2 64) .cse2) (bvsdiv (bvadd .cse0 (_ bv18446744073709551615 64)) (_ bv2 64)))) .cse3)))) is different from true [2023-02-18 19:25:04,988 WARN L859 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1| (_ BitVec 32))) (let ((.cse3 ((_ sign_extend 32) |ULTIMATE.start_main_~b~0#1|)) (.cse4 ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|))) (let ((.cse1 (bvmul (_ bv2 64) .cse4)) (.cse0 (bvsdiv .cse3 (_ bv2 64))) (.cse2 (bvmul .cse4 .cse3))) (or (not (= (_ bv1 64) (bvsrem .cse0 (_ bv2 64)))) (not (= (bvadd (_ bv0 64) (bvmul .cse1 .cse0)) .cse2)) (= (bvadd (bvadd (_ bv0 64) .cse1) (bvmul (bvmul (_ bv2 64) .cse1) (bvsdiv (bvadd .cse0 (_ bv18446744073709551615 64)) (_ bv2 64)))) .cse2) (not (bvsge |ULTIMATE.start_main_~b~0#1| (_ bv0 32))) (= (_ bv1 64) (bvsrem .cse3 (_ bv2 64))) (not (bvsle |ULTIMATE.start_main_~b~0#1| (_ bv50 32))))))) is different from true [2023-02-18 19:25:04,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 19:25:04,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1376852061] [2023-02-18 19:25:04,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1376852061] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 19:25:04,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [874252328] [2023-02-18 19:25:04,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 19:25:04,989 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-18 19:25:04,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-18 19:25:04,990 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-18 19:25:04,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2023-02-18 19:25:05,282 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 19:25:05,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 19:25:05,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-18 19:25:05,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 19:25:22,952 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-18 19:25:22,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 19:25:44,586 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul (_ bv2 64) |c_ULTIMATE.start_main_~x~0#1|)) (.cse2 (bvsdiv |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64))) (.cse0 (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~a~0#1|) ((_ sign_extend 32) |c_ULTIMATE.start_main_~b~0#1|)))) (or (not (= (bvadd |c_ULTIMATE.start_main_~z~0#1| (bvmul |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)) .cse0)) (= (bvadd (bvadd |c_ULTIMATE.start_main_~z~0#1| .cse1) (bvmul (bvmul (_ bv2 64) .cse1) (bvsdiv (bvadd .cse2 (_ bv18446744073709551615 64)) (_ bv2 64)))) .cse0) (= (_ bv1 64) (bvsrem |c_ULTIMATE.start_main_~y~0#1| (_ bv2 64))) (not (= (_ bv1 64) (bvsrem .cse2 (_ bv2 64)))) (not (= (bvadd |c_ULTIMATE.start_main_~z~0#1| (bvmul .cse1 .cse2)) .cse0)))) is different from true [2023-02-18 19:25:50,937 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_47| (_ BitVec 64))) (let ((.cse0 (bvsdiv |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_47| (_ bv2 64)))) (or (= (_ bv1 64) (bvsrem |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_47| (_ bv2 64))) (not (= (_ bv1 64) (bvsrem .cse0 (_ bv2 64)))) (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_82| (_ BitVec 32)) (|v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_71| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_46| (_ BitVec 64))) (let ((.cse3 (bvmul ((_ sign_extend 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_82|) ((_ sign_extend 32) |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_71|)))) (let ((.cse1 (bvadd .cse3 (bvmul (_ bv18446744073709551614 64) .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_46|)))) (or (= (let ((.cse2 (bvmul (_ bv2 64) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_46|))) (bvadd (bvadd .cse1 .cse2) (bvmul (bvmul (_ bv2 64) .cse2) (bvsdiv (bvadd .cse0 (_ bv18446744073709551615 64)) (_ bv2 64))))) .cse3) (= (bvadd .cse1 (bvmul |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_46| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_47|)) .cse3)))))))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2023-02-18 19:25:57,278 WARN L859 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c___VERIFIER_assert_~cond) (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_47| (_ BitVec 64))) (let ((.cse0 (bvsdiv |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_47| (_ bv2 64)))) (or (= (_ bv1 64) (bvsrem |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_47| (_ bv2 64))) (not (= (_ bv1 64) (bvsrem .cse0 (_ bv2 64)))) (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_82| (_ BitVec 32)) (|v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_71| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_46| (_ BitVec 64))) (let ((.cse3 (bvmul ((_ sign_extend 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_82|) ((_ sign_extend 32) |v_ULTIMATE.start_main_~b~0#1_BEFORE_CALL_71|)))) (let ((.cse1 (bvadd .cse3 (bvmul (_ bv18446744073709551614 64) .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_46|)))) (or (= (let ((.cse2 (bvmul (_ bv2 64) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_46|))) (bvadd (bvadd .cse1 .cse2) (bvmul (bvmul (_ bv2 64) .cse2) (bvsdiv (bvadd .cse0 (_ bv18446744073709551615 64)) (_ bv2 64))))) .cse3) (= (bvadd .cse1 (bvmul |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_46| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_47|)) .cse3)))))))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2023-02-18 19:25:59,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [874252328] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 19:25:59,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 19:25:59,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2023-02-18 19:25:59,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078720649] [2023-02-18 19:25:59,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 19:25:59,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 19:25:59,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 19:25:59,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 19:25:59,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=354, Unknown=12, NotChecked=360, Total=812 [2023-02-18 19:25:59,404 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 13 states have internal predecessors, (29), 6 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-18 19:26:12,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]