./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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/mannadiv_unwindbound50.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 7aff0c23635f1e1acd85672a1024d6cb6d0af57cad0028c56f5d301198b4eae6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 04:03:47,300 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 04:03:47,307 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 04:03:47,346 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 04:03:47,347 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 04:03:47,349 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 04:03:47,352 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 04:03:47,355 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 04:03:47,357 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 04:03:47,361 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 04:03:47,363 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 04:03:47,365 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 04:03:47,365 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 04:03:47,367 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 04:03:47,368 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 04:03:47,373 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 04:03:47,374 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 04:03:47,375 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 04:03:47,377 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 04:03:47,382 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 04:03:47,384 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 04:03:47,385 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 04:03:47,386 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 04:03:47,387 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 04:03:47,388 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 04:03:47,394 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 04:03:47,395 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 04:03:47,396 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 04:03:47,396 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 04:03:47,397 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 04:03:47,398 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 04:03:47,398 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 04:03:47,399 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 04:03:47,400 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 04:03:47,401 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 04:03:47,402 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 04:03:47,402 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 04:03:47,403 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 04:03:47,403 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 04:03:47,404 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 04:03:47,404 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 04:03:47,406 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 04:03:47,414 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 04:03:47,443 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 04:03:47,444 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 04:03:47,444 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 04:03:47,444 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 04:03:47,445 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 04:03:47,445 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 04:03:47,446 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 04:03:47,446 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 04:03:47,446 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 04:03:47,447 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 04:03:47,447 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 04:03:47,447 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 04:03:47,448 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 04:03:47,448 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 04:03:47,448 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 04:03:47,448 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 04:03:47,449 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 04:03:47,449 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 04:03:47,449 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 04:03:47,449 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 04:03:47,449 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 04:03:47,450 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 04:03:47,450 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 04:03:47,450 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 04:03:47,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 04:03:47,450 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 04:03:47,451 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 04:03:47,451 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 04:03:47,451 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 04:03:47,451 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 04:03:47,451 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 04:03:47,452 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 04:03:47,452 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 04:03:47,452 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7aff0c23635f1e1acd85672a1024d6cb6d0af57cad0028c56f5d301198b4eae6 [2022-07-21 04:03:47,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 04:03:47,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 04:03:47,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 04:03:47,819 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 04:03:47,819 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 04:03:47,821 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound50.c [2022-07-21 04:03:47,872 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58355590f/76ae378110e84afaaf17bebe4b7e30c1/FLAG98617e380 [2022-07-21 04:03:48,232 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 04:03:48,232 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound50.c [2022-07-21 04:03:48,237 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58355590f/76ae378110e84afaaf17bebe4b7e30c1/FLAG98617e380 [2022-07-21 04:03:48,653 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58355590f/76ae378110e84afaaf17bebe4b7e30c1 [2022-07-21 04:03:48,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 04:03:48,656 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 04:03:48,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 04:03:48,660 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 04:03:48,663 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 04:03:48,663 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 04:03:48" (1/1) ... [2022-07-21 04:03:48,664 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5438c6e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:03:48, skipping insertion in model container [2022-07-21 04:03:48,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 04:03:48" (1/1) ... [2022-07-21 04:03:48,670 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 04:03:48,689 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 04:03:48,790 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound50.c[573,586] [2022-07-21 04:03:48,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 04:03:48,810 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 04:03:48,820 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound50.c[573,586] [2022-07-21 04:03:48,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 04:03:48,857 INFO L208 MainTranslator]: Completed translation [2022-07-21 04:03:48,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:03:48 WrapperNode [2022-07-21 04:03:48,872 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 04:03:48,873 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 04:03:48,873 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 04:03:48,873 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 04:03:48,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:03:48" (1/1) ... [2022-07-21 04:03:48,884 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:03:48" (1/1) ... [2022-07-21 04:03:48,897 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2022-07-21 04:03:48,898 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 04:03:48,899 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 04:03:48,899 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 04:03:48,899 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 04:03:48,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:03:48" (1/1) ... [2022-07-21 04:03:48,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:03:48" (1/1) ... [2022-07-21 04:03:48,907 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:03:48" (1/1) ... [2022-07-21 04:03:48,907 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:03:48" (1/1) ... [2022-07-21 04:03:48,910 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:03:48" (1/1) ... [2022-07-21 04:03:48,913 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:03:48" (1/1) ... [2022-07-21 04:03:48,914 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:03:48" (1/1) ... [2022-07-21 04:03:48,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 04:03:48,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 04:03:48,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 04:03:48,916 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 04:03:48,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:03:48" (1/1) ... [2022-07-21 04:03:48,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 04:03:48,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 04:03:48,940 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 04:03:48,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 04:03:48,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 04:03:48,967 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-21 04:03:48,968 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-21 04:03:48,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 04:03:48,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 04:03:48,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 04:03:48,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-21 04:03:48,972 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-21 04:03:49,017 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 04:03:49,018 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 04:03:49,158 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 04:03:49,165 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 04:03:49,166 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-21 04:03:49,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 04:03:49 BoogieIcfgContainer [2022-07-21 04:03:49,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 04:03:49,170 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 04:03:49,171 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 04:03:49,173 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 04:03:49,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 04:03:48" (1/3) ... [2022-07-21 04:03:49,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451e9d93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 04:03:49, skipping insertion in model container [2022-07-21 04:03:49,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:03:48" (2/3) ... [2022-07-21 04:03:49,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451e9d93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 04:03:49, skipping insertion in model container [2022-07-21 04:03:49,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 04:03:49" (3/3) ... [2022-07-21 04:03:49,176 INFO L111 eAbstractionObserver]: Analyzing ICFG mannadiv_unwindbound50.c [2022-07-21 04:03:49,190 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 04:03:49,190 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 04:03:49,249 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 04:03:49,256 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@31c14a09, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@76f3eb6c [2022-07-21 04:03:49,257 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 04:03:49,267 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 04:03:49,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 04:03:49,276 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 04:03:49,277 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 04:03:49,278 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 04:03:49,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 04:03:49,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1086166160, now seen corresponding path program 1 times [2022-07-21 04:03:49,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 04:03:49,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037281182] [2022-07-21 04:03:49,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 04:03:49,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 04:03:49,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 04:03:49,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 04:03:49,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 04:03:49,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 04:03:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 04:03:49,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 04:03:49,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 04:03:49,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037281182] [2022-07-21 04:03:49,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037281182] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 04:03:49,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 04:03:49,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 04:03:49,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321725013] [2022-07-21 04:03:49,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 04:03:49,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 04:03:49,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 04:03:49,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 04:03:49,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 04:03:49,496 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 04:03:49,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 04:03:49,513 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-07-21 04:03:49,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 04:03:49,516 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-07-21 04:03:49,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 04:03:49,522 INFO L225 Difference]: With dead ends: 47 [2022-07-21 04:03:49,522 INFO L226 Difference]: Without dead ends: 21 [2022-07-21 04:03:49,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 04:03:49,530 INFO L413 NwaCegarLoop]: 29 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, 29 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 04:03:49,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 04:03:49,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-21 04:03:49,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-21 04:03:49,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 04:03:49,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-07-21 04:03:49,564 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 18 [2022-07-21 04:03:49,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 04:03:49,565 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-07-21 04:03:49,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 04:03:49,566 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-07-21 04:03:49,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-21 04:03:49,567 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 04:03:49,568 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 04:03:49,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 04:03:49,569 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 04:03:49,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 04:03:49,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1345709874, now seen corresponding path program 1 times [2022-07-21 04:03:49,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 04:03:49,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929026882] [2022-07-21 04:03:49,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 04:03:49,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 04:03:49,601 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 04:03:49,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1680256407] [2022-07-21 04:03:49,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 04:03:49,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 04:03:49,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 04:03:49,606 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 04:03:49,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 04:03:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 04:03:49,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 04:03:49,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 04:03:49,791 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 04:03:49,791 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 04:03:49,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 04:03:49,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929026882] [2022-07-21 04:03:49,792 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 04:03:49,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680256407] [2022-07-21 04:03:49,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680256407] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 04:03:49,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 04:03:49,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 04:03:49,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301164910] [2022-07-21 04:03:49,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 04:03:49,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 04:03:49,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 04:03:49,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 04:03:49,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 04:03:49,800 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 04:03:49,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 04:03:49,833 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-07-21 04:03:49,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 04:03:49,834 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-07-21 04:03:49,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 04:03:49,835 INFO L225 Difference]: With dead ends: 30 [2022-07-21 04:03:49,835 INFO L226 Difference]: Without dead ends: 23 [2022-07-21 04:03:49,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 04:03:49,837 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 04:03:49,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 04:03:49,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-21 04:03:49,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-21 04:03:49,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 04:03:49,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-07-21 04:03:49,843 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 19 [2022-07-21 04:03:49,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 04:03:49,844 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-07-21 04:03:49,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 04:03:49,844 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-07-21 04:03:49,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-21 04:03:49,845 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 04:03:49,845 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 04:03:49,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 04:03:50,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 04:03:50,068 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 04:03:50,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 04:03:50,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1347497334, now seen corresponding path program 1 times [2022-07-21 04:03:50,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 04:03:50,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344305519] [2022-07-21 04:03:50,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 04:03:50,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 04:03:50,088 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 04:03:50,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [537168294] [2022-07-21 04:03:50,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 04:03:50,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 04:03:50,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 04:03:50,091 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 04:03:50,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 04:03:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 04:03:50,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-21 04:03:50,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 04:03:50,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 04:03:50,380 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 04:03:50,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 04:03:50,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344305519] [2022-07-21 04:03:50,380 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 04:03:50,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537168294] [2022-07-21 04:03:50,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537168294] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 04:03:50,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 04:03:50,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 04:03:50,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024714543] [2022-07-21 04:03:50,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 04:03:50,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 04:03:50,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 04:03:50,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 04:03:50,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-21 04:03:50,383 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 04:03:50,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 04:03:50,481 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-07-21 04:03:50,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 04:03:50,482 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-07-21 04:03:50,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 04:03:50,483 INFO L225 Difference]: With dead ends: 33 [2022-07-21 04:03:50,483 INFO L226 Difference]: Without dead ends: 31 [2022-07-21 04:03:50,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-21 04:03:50,485 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 33 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 04:03:50,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 72 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 04:03:50,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-21 04:03:50,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-07-21 04:03:50,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 04:03:50,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-21 04:03:50,493 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2022-07-21 04:03:50,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 04:03:50,494 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-21 04:03:50,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 04:03:50,494 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-21 04:03:50,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-21 04:03:50,495 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 04:03:50,495 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 04:03:50,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 04:03:50,709 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,SelfDestructingSolverStorable2 [2022-07-21 04:03:50,709 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 04:03:50,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 04:03:50,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1636478750, now seen corresponding path program 1 times [2022-07-21 04:03:50,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 04:03:50,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994603227] [2022-07-21 04:03:50,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 04:03:50,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 04:03:50,725 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 04:03:50,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [455053209] [2022-07-21 04:03:50,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 04:03:50,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 04:03:50,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 04:03:50,728 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) [2022-07-21 04:03:50,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 04:03:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 04:03:50,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 04:03:50,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 04:03:50,875 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 04:03:50,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 04:03:51,023 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 04:03:51,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 04:03:51,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994603227] [2022-07-21 04:03:51,024 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 04:03:51,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455053209] [2022-07-21 04:03:51,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455053209] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 04:03:51,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 04:03:51,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-07-21 04:03:51,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223235157] [2022-07-21 04:03:51,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 04:03:51,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 04:03:51,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 04:03:51,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 04:03:51,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-21 04:03:51,030 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-21 04:03:51,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 04:03:51,117 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-07-21 04:03:51,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 04:03:51,118 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 25 [2022-07-21 04:03:51,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 04:03:51,121 INFO L225 Difference]: With dead ends: 35 [2022-07-21 04:03:51,121 INFO L226 Difference]: Without dead ends: 30 [2022-07-21 04:03:51,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-07-21 04:03:51,126 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 22 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 04:03:51,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 84 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 04:03:51,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-21 04:03:51,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2022-07-21 04:03:51,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 04:03:51,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-07-21 04:03:51,137 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 25 [2022-07-21 04:03:51,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 04:03:51,140 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-07-21 04:03:51,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-21 04:03:51,141 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-07-21 04:03:51,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-21 04:03:51,142 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 04:03:51,142 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 04:03:51,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-21 04:03:51,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 04:03:51,364 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 04:03:51,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 04:03:51,364 INFO L85 PathProgramCache]: Analyzing trace with hash -126969667, now seen corresponding path program 1 times [2022-07-21 04:03:51,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 04:03:51,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639070471] [2022-07-21 04:03:51,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 04:03:51,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 04:03:51,375 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 04:03:51,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [240673053] [2022-07-21 04:03:51,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 04:03:51,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 04:03:51,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 04:03:51,377 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) [2022-07-21 04:03:51,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 04:03:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 04:03:51,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 04:03:51,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 04:03:51,458 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 04:03:51,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 04:03:51,498 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 04:03:51,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 04:03:51,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639070471] [2022-07-21 04:03:51,499 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 04:03:51,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240673053] [2022-07-21 04:03:51,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240673053] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 04:03:51,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 04:03:51,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-07-21 04:03:51,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817691463] [2022-07-21 04:03:51,500 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 04:03:51,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 04:03:51,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 04:03:51,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 04:03:51,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-21 04:03:51,501 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 04:03:51,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 04:03:51,553 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-07-21 04:03:51,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 04:03:51,554 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2022-07-21 04:03:51,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 04:03:51,555 INFO L225 Difference]: With dead ends: 57 [2022-07-21 04:03:51,555 INFO L226 Difference]: Without dead ends: 52 [2022-07-21 04:03:51,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-21 04:03:51,556 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 24 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 04:03:51,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 93 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 04:03:51,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-21 04:03:51,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-07-21 04:03:51,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 04:03:51,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2022-07-21 04:03:51,565 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 28 [2022-07-21 04:03:51,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 04:03:51,565 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2022-07-21 04:03:51,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 04:03:51,566 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-07-21 04:03:51,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-21 04:03:51,567 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 04:03:51,567 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 04:03:51,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 04:03:51,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 04:03:51,783 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 04:03:51,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 04:03:51,784 INFO L85 PathProgramCache]: Analyzing trace with hash 972990450, now seen corresponding path program 2 times [2022-07-21 04:03:51,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 04:03:51,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943167088] [2022-07-21 04:03:51,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 04:03:51,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 04:03:51,795 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 04:03:51,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [715129948] [2022-07-21 04:03:51,796 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 04:03:51,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 04:03:51,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 04:03:51,797 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) [2022-07-21 04:03:51,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-21 04:03:51,849 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 04:03:51,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 04:03:51,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-21 04:03:51,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 04:03:51,960 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 04:03:51,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 04:03:52,080 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-21 04:03:52,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 04:03:52,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943167088] [2022-07-21 04:03:52,081 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 04:03:52,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715129948] [2022-07-21 04:03:52,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715129948] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 04:03:52,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 04:03:52,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-07-21 04:03:52,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590763511] [2022-07-21 04:03:52,082 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 04:03:52,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 04:03:52,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 04:03:52,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 04:03:52,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-07-21 04:03:52,087 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-07-21 04:03:52,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 04:03:52,264 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2022-07-21 04:03:52,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-21 04:03:52,266 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 55 [2022-07-21 04:03:52,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 04:03:52,271 INFO L225 Difference]: With dead ends: 111 [2022-07-21 04:03:52,272 INFO L226 Difference]: Without dead ends: 106 [2022-07-21 04:03:52,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-07-21 04:03:52,273 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 68 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 04:03:52,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 175 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 04:03:52,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-21 04:03:52,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-07-21 04:03:52,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 81 states have (on average 1.1358024691358024) internal successors, (92), 81 states have internal predecessors, (92), 13 states have call successors, (13), 12 states have call predecessors, (13), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-21 04:03:52,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2022-07-21 04:03:52,303 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 55 [2022-07-21 04:03:52,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 04:03:52,305 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2022-07-21 04:03:52,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2022-07-21 04:03:52,306 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2022-07-21 04:03:52,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-21 04:03:52,314 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 04:03:52,315 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 04:03:52,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-21 04:03:52,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 04:03:52,532 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 04:03:52,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 04:03:52,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1909967598, now seen corresponding path program 3 times [2022-07-21 04:03:52,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 04:03:52,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787848377] [2022-07-21 04:03:52,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 04:03:52,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 04:03:52,552 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 04:03:52,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1234781281] [2022-07-21 04:03:52,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 04:03:52,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 04:03:52,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 04:03:52,556 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) [2022-07-21 04:03:52,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-21 04:03:52,631 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-07-21 04:03:52,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 04:03:52,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-21 04:03:52,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 04:03:52,851 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 04:03:52,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 04:03:53,120 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-07-21 04:03:53,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 04:03:53,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787848377] [2022-07-21 04:03:53,121 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 04:03:53,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234781281] [2022-07-21 04:03:53,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234781281] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 04:03:53,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 04:03:53,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2022-07-21 04:03:53,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297133578] [2022-07-21 04:03:53,123 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 04:03:53,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-21 04:03:53,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 04:03:53,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-21 04:03:53,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-07-21 04:03:53,126 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand has 26 states, 26 states have (on average 5.076923076923077) internal successors, (132), 26 states have internal predecessors, (132), 23 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2022-07-21 04:03:53,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 04:03:53,561 INFO L93 Difference]: Finished difference Result 219 states and 253 transitions. [2022-07-21 04:03:53,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-07-21 04:03:53,562 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.076923076923077) internal successors, (132), 26 states have internal predecessors, (132), 23 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) Word has length 109 [2022-07-21 04:03:53,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 04:03:53,564 INFO L225 Difference]: With dead ends: 219 [2022-07-21 04:03:53,564 INFO L226 Difference]: Without dead ends: 214 [2022-07-21 04:03:53,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2022-07-21 04:03:53,566 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 285 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 04:03:53,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 242 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 04:03:53,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-07-21 04:03:53,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2022-07-21 04:03:53,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 165 states have (on average 1.1393939393939394) internal successors, (188), 165 states have internal predecessors, (188), 25 states have call successors, (25), 24 states have call predecessors, (25), 23 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-21 04:03:53,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 237 transitions. [2022-07-21 04:03:53,585 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 237 transitions. Word has length 109 [2022-07-21 04:03:53,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 04:03:53,586 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 237 transitions. [2022-07-21 04:03:53,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.076923076923077) internal successors, (132), 26 states have internal predecessors, (132), 23 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2022-07-21 04:03:53,586 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 237 transitions. [2022-07-21 04:03:53,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2022-07-21 04:03:53,589 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 04:03:53,589 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 04:03:53,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-21 04:03:53,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 04:03:53,816 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 04:03:53,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 04:03:53,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1216739502, now seen corresponding path program 4 times [2022-07-21 04:03:53,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 04:03:53,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863086087] [2022-07-21 04:03:53,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 04:03:53,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 04:03:53,832 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 04:03:53,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1922446346] [2022-07-21 04:03:53,832 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 04:03:53,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 04:03:53,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 04:03:53,834 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) [2022-07-21 04:03:53,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-21 04:03:53,957 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 04:03:53,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 04:03:53,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-21 04:03:53,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 04:03:54,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 44 proven. 2123 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 04:03:54,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 04:03:55,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 44 proven. 1199 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked. [2022-07-21 04:03:55,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 04:03:55,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863086087] [2022-07-21 04:03:55,329 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 04:03:55,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922446346] [2022-07-21 04:03:55,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922446346] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 04:03:55,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 04:03:55,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2022-07-21 04:03:55,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467816540] [2022-07-21 04:03:55,330 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 04:03:55,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-21 04:03:55,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 04:03:55,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-21 04:03:55,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2022-07-21 04:03:55,333 INFO L87 Difference]: Start difference. First operand 214 states and 237 transitions. Second operand has 50 states, 50 states have (on average 5.28) internal successors, (264), 50 states have internal predecessors, (264), 47 states have call successors, (49), 25 states have call predecessors, (49), 24 states have return successors, (48), 46 states have call predecessors, (48), 46 states have call successors, (48) [2022-07-21 04:03:56,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 04:03:56,700 INFO L93 Difference]: Finished difference Result 435 states and 505 transitions. [2022-07-21 04:03:56,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-07-21 04:03:56,700 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.28) internal successors, (264), 50 states have internal predecessors, (264), 47 states have call successors, (49), 25 states have call predecessors, (49), 24 states have return successors, (48), 46 states have call predecessors, (48), 46 states have call successors, (48) Word has length 217 [2022-07-21 04:03:56,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 04:03:56,704 INFO L225 Difference]: With dead ends: 435 [2022-07-21 04:03:56,704 INFO L226 Difference]: Without dead ends: 430 [2022-07-21 04:03:56,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2022-07-21 04:03:56,708 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 788 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 04:03:56,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 494 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 04:03:56,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2022-07-21 04:03:56,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2022-07-21 04:03:56,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 333 states have (on average 1.1411411411411412) internal successors, (380), 333 states have internal predecessors, (380), 49 states have call successors, (49), 48 states have call predecessors, (49), 47 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-07-21 04:03:56,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 477 transitions. [2022-07-21 04:03:56,738 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 477 transitions. Word has length 217 [2022-07-21 04:03:56,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 04:03:56,739 INFO L495 AbstractCegarLoop]: Abstraction has 430 states and 477 transitions. [2022-07-21 04:03:56,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.28) internal successors, (264), 50 states have internal predecessors, (264), 47 states have call successors, (49), 25 states have call predecessors, (49), 24 states have return successors, (48), 46 states have call predecessors, (48), 46 states have call successors, (48) [2022-07-21 04:03:56,740 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 477 transitions. [2022-07-21 04:03:56,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2022-07-21 04:03:56,746 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 04:03:56,746 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 04:03:56,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-21 04:03:56,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 04:03:56,964 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 04:03:56,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 04:03:56,964 INFO L85 PathProgramCache]: Analyzing trace with hash -623866926, now seen corresponding path program 5 times [2022-07-21 04:03:56,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 04:03:56,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120432169] [2022-07-21 04:03:56,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 04:03:56,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 04:03:57,002 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 04:03:57,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [8084494] [2022-07-21 04:03:57,005 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 04:03:57,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 04:03:57,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 04:03:57,007 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 04:03:57,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-21 04:03:57,462 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2022-07-21 04:03:57,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 04:03:57,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 1127 conjuncts, 95 conjunts are in the unsatisfiable core [2022-07-21 04:03:57,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 04:03:58,804 INFO L134 CoverageAnalysis]: Checked inductivity of 9503 backedges. 92 proven. 9407 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 04:03:58,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 04:03:59,333 INFO L134 CoverageAnalysis]: Checked inductivity of 9503 backedges. 92 proven. 5267 refuted. 0 times theorem prover too weak. 4144 trivial. 0 not checked. [2022-07-21 04:03:59,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 04:03:59,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120432169] [2022-07-21 04:03:59,334 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-21 04:03:59,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8084494] [2022-07-21 04:03:59,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8084494] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 04:03:59,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 04:03:59,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 54 [2022-07-21 04:03:59,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880513490] [2022-07-21 04:03:59,335 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 04:03:59,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-07-21 04:03:59,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 04:03:59,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-07-21 04:03:59,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2022-07-21 04:03:59,338 INFO L87 Difference]: Start difference. First operand 430 states and 477 transitions. Second operand has 54 states, 54 states have (on average 6.592592592592593) internal successors, (356), 54 states have internal predecessors, (356), 51 states have call successors, (97), 49 states have call predecessors, (97), 48 states have return successors, (96), 50 states have call predecessors, (96), 50 states have call successors, (96) [2022-07-21 04:04:00,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 04:04:00,719 INFO L93 Difference]: Finished difference Result 471 states and 525 transitions. [2022-07-21 04:04:00,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-07-21 04:04:00,720 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 6.592592592592593) internal successors, (356), 54 states have internal predecessors, (356), 51 states have call successors, (97), 49 states have call predecessors, (97), 48 states have return successors, (96), 50 states have call predecessors, (96), 50 states have call successors, (96) Word has length 433 [2022-07-21 04:04:00,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 04:04:00,724 INFO L225 Difference]: With dead ends: 471 [2022-07-21 04:04:00,724 INFO L226 Difference]: Without dead ends: 466 [2022-07-21 04:04:00,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 913 GetRequests, 811 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3926, Invalid=6580, Unknown=0, NotChecked=0, Total=10506 [2022-07-21 04:04:00,727 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 458 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 04:04:00,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 535 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 04:04:00,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2022-07-21 04:04:00,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2022-07-21 04:04:00,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 361 states have (on average 1.1412742382271468) internal successors, (412), 361 states have internal predecessors, (412), 53 states have call successors, (53), 52 states have call predecessors, (53), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-07-21 04:04:00,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 517 transitions. [2022-07-21 04:04:00,759 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 517 transitions. Word has length 433 [2022-07-21 04:04:00,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 04:04:00,760 INFO L495 AbstractCegarLoop]: Abstraction has 466 states and 517 transitions. [2022-07-21 04:04:00,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 6.592592592592593) internal successors, (356), 54 states have internal predecessors, (356), 51 states have call successors, (97), 49 states have call predecessors, (97), 48 states have return successors, (96), 50 states have call predecessors, (96), 50 states have call successors, (96) [2022-07-21 04:04:00,760 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 517 transitions. [2022-07-21 04:04:00,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2022-07-21 04:04:00,767 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 04:04:00,767 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 50, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 04:04:00,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-21 04:04:00,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-21 04:04:00,983 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 04:04:00,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 04:04:00,983 INFO L85 PathProgramCache]: Analyzing trace with hash -872711022, now seen corresponding path program 6 times [2022-07-21 04:04:00,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 04:04:00,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802579743] [2022-07-21 04:04:00,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 04:04:00,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 04:04:01,005 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-21 04:04:01,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [438349289] [2022-07-21 04:04:01,005 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-21 04:04:01,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 04:04:01,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 04:04:01,007 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 04:04:01,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-21 04:04:01,413 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2022-07-21 04:04:01,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-21 04:04:01,413 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 04:04:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 04:04:01,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 04:04:01,828 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 04:04:01,829 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 04:04:01,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-21 04:04:02,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-21 04:04:02,046 INFO L356 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1] [2022-07-21 04:04:02,049 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 04:04:02,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 04:04:02 BoogieIcfgContainer [2022-07-21 04:04:02,188 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 04:04:02,189 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 04:04:02,189 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 04:04:02,189 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 04:04:02,190 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 04:03:49" (3/4) ... [2022-07-21 04:04:02,191 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-21 04:04:02,316 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 04:04:02,316 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 04:04:02,317 INFO L158 Benchmark]: Toolchain (without parser) took 13660.67ms. Allocated memory was 50.3MB in the beginning and 146.8MB in the end (delta: 96.5MB). Free memory was 25.2MB in the beginning and 81.6MB in the end (delta: -56.4MB). Peak memory consumption was 39.9MB. Max. memory is 16.1GB. [2022-07-21 04:04:02,317 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 50.3MB. Free memory was 31.6MB in the beginning and 31.6MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 04:04:02,317 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.66ms. Allocated memory was 50.3MB in the beginning and 69.2MB in the end (delta: 18.9MB). Free memory was 25.0MB in the beginning and 52.5MB in the end (delta: -27.5MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2022-07-21 04:04:02,318 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.52ms. Allocated memory is still 69.2MB. Free memory was 52.5MB in the beginning and 51.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 04:04:02,318 INFO L158 Benchmark]: Boogie Preprocessor took 16.20ms. Allocated memory is still 69.2MB. Free memory was 50.8MB in the beginning and 49.9MB in the end (delta: 943.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 04:04:02,318 INFO L158 Benchmark]: RCFGBuilder took 251.72ms. Allocated memory is still 69.2MB. Free memory was 49.9MB in the beginning and 40.6MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-21 04:04:02,319 INFO L158 Benchmark]: TraceAbstraction took 13018.25ms. Allocated memory was 69.2MB in the beginning and 146.8MB in the end (delta: 77.6MB). Free memory was 40.1MB in the beginning and 98.3MB in the end (delta: -58.2MB). Peak memory consumption was 75.7MB. Max. memory is 16.1GB. [2022-07-21 04:04:02,320 INFO L158 Benchmark]: Witness Printer took 127.20ms. Allocated memory is still 146.8MB. Free memory was 98.3MB in the beginning and 81.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-21 04:04:02,321 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.23ms. Allocated memory is still 50.3MB. Free memory was 31.6MB in the beginning and 31.6MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.66ms. Allocated memory was 50.3MB in the beginning and 69.2MB in the end (delta: 18.9MB). Free memory was 25.0MB in the beginning and 52.5MB in the end (delta: -27.5MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.52ms. Allocated memory is still 69.2MB. Free memory was 52.5MB in the beginning and 51.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.20ms. Allocated memory is still 69.2MB. Free memory was 50.8MB in the beginning and 49.9MB in the end (delta: 943.9kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 251.72ms. Allocated memory is still 69.2MB. Free memory was 49.9MB in the beginning and 40.6MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 13018.25ms. Allocated memory was 69.2MB in the beginning and 146.8MB in the end (delta: 77.6MB). Free memory was 40.1MB in the beginning and 98.3MB in the end (delta: -58.2MB). Peak memory consumption was 75.7MB. Max. memory is 16.1GB. * Witness Printer took 127.20ms. Allocated memory is still 146.8MB. Free memory was 98.3MB in the beginning and 81.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [counter=0] [L24] int x1, x2; [L25] int y1, y2, y3; [L26] x1 = __VERIFIER_nondet_int() [L27] x2 = __VERIFIER_nondet_int() [L29] CALL assume_abort_if_not(x1 >= 0) VAL [\old(cond)=1, counter=0] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L29] RET assume_abort_if_not(x1 >= 0) VAL [counter=0, x1=51, x2=1] [L30] CALL assume_abort_if_not(x2 != 0) VAL [\old(cond)=1, counter=0] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L30] RET assume_abort_if_not(x2 != 0) VAL [counter=0, x1=51, x2=1] [L32] y1 = 0 [L33] y2 = 0 [L34] y3 = x1 VAL [counter=0, x1=51, x2=1, y1=0, y2=0, y3=51] [L36] EXPR counter++ VAL [counter=1, counter++=0, x1=51, x2=1, y1=0, y2=0, y3=51] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=1, x1=51, x2=1, y1=0, y2=0, y3=51] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=1, x1=51, x2=1, y1=0, y2=0, y3=51] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=1, x1=51, x2=1, y1=1, y2=0, y3=50] [L36] EXPR counter++ VAL [counter=2, counter++=1, x1=51, x2=1, y1=1, y2=0, y3=50] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=2] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=2, x1=51, x2=1, y1=1, y2=0, y3=50] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=2, x1=51, x2=1, y1=1, y2=0, y3=50] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=2, x1=51, x2=1, y1=2, y2=0, y3=49] [L36] EXPR counter++ VAL [counter=3, counter++=2, x1=51, x2=1, y1=2, y2=0, y3=49] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=3] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=3, x1=51, x2=1, y1=2, y2=0, y3=49] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=3, x1=51, x2=1, y1=2, y2=0, y3=49] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=3, x1=51, x2=1, y1=3, y2=0, y3=48] [L36] EXPR counter++ VAL [counter=4, counter++=3, x1=51, x2=1, y1=3, y2=0, y3=48] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=4] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=4, x1=51, x2=1, y1=3, y2=0, y3=48] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=4, x1=51, x2=1, y1=3, y2=0, y3=48] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=4, x1=51, x2=1, y1=4, y2=0, y3=47] [L36] EXPR counter++ VAL [counter=5, counter++=4, x1=51, x2=1, y1=4, y2=0, y3=47] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=5] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=5, x1=51, x2=1, y1=4, y2=0, y3=47] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=5, x1=51, x2=1, y1=4, y2=0, y3=47] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=5, x1=51, x2=1, y1=5, y2=0, y3=46] [L36] EXPR counter++ VAL [counter=6, counter++=5, x1=51, x2=1, y1=5, y2=0, y3=46] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=6] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=6, x1=51, x2=1, y1=5, y2=0, y3=46] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=6, x1=51, x2=1, y1=5, y2=0, y3=46] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=6, x1=51, x2=1, y1=6, y2=0, y3=45] [L36] EXPR counter++ VAL [counter=7, counter++=6, x1=51, x2=1, y1=6, y2=0, y3=45] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=7] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=7, x1=51, x2=1, y1=6, y2=0, y3=45] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=7, x1=51, x2=1, y1=6, y2=0, y3=45] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=7, x1=51, x2=1, y1=7, y2=0, y3=44] [L36] EXPR counter++ VAL [counter=8, counter++=7, x1=51, x2=1, y1=7, y2=0, y3=44] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=8] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=8, x1=51, x2=1, y1=7, y2=0, y3=44] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=8, x1=51, x2=1, y1=7, y2=0, y3=44] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=8, x1=51, x2=1, y1=8, y2=0, y3=43] [L36] EXPR counter++ VAL [counter=9, counter++=8, x1=51, x2=1, y1=8, y2=0, y3=43] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=9] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=9, x1=51, x2=1, y1=8, y2=0, y3=43] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=9, x1=51, x2=1, y1=8, y2=0, y3=43] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=9, x1=51, x2=1, y1=9, y2=0, y3=42] [L36] EXPR counter++ VAL [counter=10, counter++=9, x1=51, x2=1, y1=9, y2=0, y3=42] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=10] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=10, x1=51, x2=1, y1=9, y2=0, y3=42] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=10, x1=51, x2=1, y1=9, y2=0, y3=42] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=10, x1=51, x2=1, y1=10, y2=0, y3=41] [L36] EXPR counter++ VAL [counter=11, counter++=10, x1=51, x2=1, y1=10, y2=0, y3=41] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=11] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=11, x1=51, x2=1, y1=10, y2=0, y3=41] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=11, x1=51, x2=1, y1=10, y2=0, y3=41] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=11, x1=51, x2=1, y1=11, y2=0, y3=40] [L36] EXPR counter++ VAL [counter=12, counter++=11, x1=51, x2=1, y1=11, y2=0, y3=40] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=12] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=12, x1=51, x2=1, y1=11, y2=0, y3=40] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=12, x1=51, x2=1, y1=11, y2=0, y3=40] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=12, x1=51, x2=1, y1=12, y2=0, y3=39] [L36] EXPR counter++ VAL [counter=13, counter++=12, x1=51, x2=1, y1=12, y2=0, y3=39] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=13] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=13, x1=51, x2=1, y1=12, y2=0, y3=39] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=13, x1=51, x2=1, y1=12, y2=0, y3=39] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=13, x1=51, x2=1, y1=13, y2=0, y3=38] [L36] EXPR counter++ VAL [counter=14, counter++=13, x1=51, x2=1, y1=13, y2=0, y3=38] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=14] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=14, x1=51, x2=1, y1=13, y2=0, y3=38] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=14, x1=51, x2=1, y1=13, y2=0, y3=38] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=14, x1=51, x2=1, y1=14, y2=0, y3=37] [L36] EXPR counter++ VAL [counter=15, counter++=14, x1=51, x2=1, y1=14, y2=0, y3=37] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=15] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=15, x1=51, x2=1, y1=14, y2=0, y3=37] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=15, x1=51, x2=1, y1=14, y2=0, y3=37] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=15, x1=51, x2=1, y1=15, y2=0, y3=36] [L36] EXPR counter++ VAL [counter=16, counter++=15, x1=51, x2=1, y1=15, y2=0, y3=36] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=16] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=16, x1=51, x2=1, y1=15, y2=0, y3=36] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=16, x1=51, x2=1, y1=15, y2=0, y3=36] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=16, x1=51, x2=1, y1=16, y2=0, y3=35] [L36] EXPR counter++ VAL [counter=17, counter++=16, x1=51, x2=1, y1=16, y2=0, y3=35] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=17] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=17, x1=51, x2=1, y1=16, y2=0, y3=35] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=17, x1=51, x2=1, y1=16, y2=0, y3=35] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=17, x1=51, x2=1, y1=17, y2=0, y3=34] [L36] EXPR counter++ VAL [counter=18, counter++=17, x1=51, x2=1, y1=17, y2=0, y3=34] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=18] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=18, x1=51, x2=1, y1=17, y2=0, y3=34] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=18, x1=51, x2=1, y1=17, y2=0, y3=34] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=18, x1=51, x2=1, y1=18, y2=0, y3=33] [L36] EXPR counter++ VAL [counter=19, counter++=18, x1=51, x2=1, y1=18, y2=0, y3=33] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=19] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=19, x1=51, x2=1, y1=18, y2=0, y3=33] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=19, x1=51, x2=1, y1=18, y2=0, y3=33] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=19, x1=51, x2=1, y1=19, y2=0, y3=32] [L36] EXPR counter++ VAL [counter=20, counter++=19, x1=51, x2=1, y1=19, y2=0, y3=32] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=20] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=20, x1=51, x2=1, y1=19, y2=0, y3=32] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=20, x1=51, x2=1, y1=19, y2=0, y3=32] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=20, x1=51, x2=1, y1=20, y2=0, y3=31] [L36] EXPR counter++ VAL [counter=21, counter++=20, x1=51, x2=1, y1=20, y2=0, y3=31] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=21] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=21, x1=51, x2=1, y1=20, y2=0, y3=31] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=21, x1=51, x2=1, y1=20, y2=0, y3=31] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=21, x1=51, x2=1, y1=21, y2=0, y3=30] [L36] EXPR counter++ VAL [counter=22, counter++=21, x1=51, x2=1, y1=21, y2=0, y3=30] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=22] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=22, x1=51, x2=1, y1=21, y2=0, y3=30] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=22, x1=51, x2=1, y1=21, y2=0, y3=30] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=22, x1=51, x2=1, y1=22, y2=0, y3=29] [L36] EXPR counter++ VAL [counter=23, counter++=22, x1=51, x2=1, y1=22, y2=0, y3=29] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=23] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=23, x1=51, x2=1, y1=22, y2=0, y3=29] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=23, x1=51, x2=1, y1=22, y2=0, y3=29] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=23, x1=51, x2=1, y1=23, y2=0, y3=28] [L36] EXPR counter++ VAL [counter=24, counter++=23, x1=51, x2=1, y1=23, y2=0, y3=28] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=24] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=24, x1=51, x2=1, y1=23, y2=0, y3=28] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=24, x1=51, x2=1, y1=23, y2=0, y3=28] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=24, x1=51, x2=1, y1=24, y2=0, y3=27] [L36] EXPR counter++ VAL [counter=25, counter++=24, x1=51, x2=1, y1=24, y2=0, y3=27] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=25] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=25, x1=51, x2=1, y1=24, y2=0, y3=27] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=25, x1=51, x2=1, y1=24, y2=0, y3=27] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=25, x1=51, x2=1, y1=25, y2=0, y3=26] [L36] EXPR counter++ VAL [counter=26, counter++=25, x1=51, x2=1, y1=25, y2=0, y3=26] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=26] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=26, x1=51, x2=1, y1=25, y2=0, y3=26] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=26, x1=51, x2=1, y1=25, y2=0, y3=26] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=26, x1=51, x2=1, y1=26, y2=0, y3=25] [L36] EXPR counter++ VAL [counter=27, counter++=26, x1=51, x2=1, y1=26, y2=0, y3=25] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=27] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=27, x1=51, x2=1, y1=26, y2=0, y3=25] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=27, x1=51, x2=1, y1=26, y2=0, y3=25] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=27, x1=51, x2=1, y1=27, y2=0, y3=24] [L36] EXPR counter++ VAL [counter=28, counter++=27, x1=51, x2=1, y1=27, y2=0, y3=24] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=28] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=28, x1=51, x2=1, y1=27, y2=0, y3=24] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=28, x1=51, x2=1, y1=27, y2=0, y3=24] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=28, x1=51, x2=1, y1=28, y2=0, y3=23] [L36] EXPR counter++ VAL [counter=29, counter++=28, x1=51, x2=1, y1=28, y2=0, y3=23] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=29] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=29, x1=51, x2=1, y1=28, y2=0, y3=23] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=29, x1=51, x2=1, y1=28, y2=0, y3=23] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=29, x1=51, x2=1, y1=29, y2=0, y3=22] [L36] EXPR counter++ VAL [counter=30, counter++=29, x1=51, x2=1, y1=29, y2=0, y3=22] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=30] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=30, x1=51, x2=1, y1=29, y2=0, y3=22] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=30, x1=51, x2=1, y1=29, y2=0, y3=22] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=30, x1=51, x2=1, y1=30, y2=0, y3=21] [L36] EXPR counter++ VAL [counter=31, counter++=30, x1=51, x2=1, y1=30, y2=0, y3=21] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=31] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=31, x1=51, x2=1, y1=30, y2=0, y3=21] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=31, x1=51, x2=1, y1=30, y2=0, y3=21] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=31, x1=51, x2=1, y1=31, y2=0, y3=20] [L36] EXPR counter++ VAL [counter=32, counter++=31, x1=51, x2=1, y1=31, y2=0, y3=20] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=32] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=32, x1=51, x2=1, y1=31, y2=0, y3=20] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=32, x1=51, x2=1, y1=31, y2=0, y3=20] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=32, x1=51, x2=1, y1=32, y2=0, y3=19] [L36] EXPR counter++ VAL [counter=33, counter++=32, x1=51, x2=1, y1=32, y2=0, y3=19] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=33] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=33, x1=51, x2=1, y1=32, y2=0, y3=19] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=33, x1=51, x2=1, y1=32, y2=0, y3=19] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=33, x1=51, x2=1, y1=33, y2=0, y3=18] [L36] EXPR counter++ VAL [counter=34, counter++=33, x1=51, x2=1, y1=33, y2=0, y3=18] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=34] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=34, x1=51, x2=1, y1=33, y2=0, y3=18] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=34, x1=51, x2=1, y1=33, y2=0, y3=18] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=34, x1=51, x2=1, y1=34, y2=0, y3=17] [L36] EXPR counter++ VAL [counter=35, counter++=34, x1=51, x2=1, y1=34, y2=0, y3=17] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=35] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=35, x1=51, x2=1, y1=34, y2=0, y3=17] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=35, x1=51, x2=1, y1=34, y2=0, y3=17] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=35, x1=51, x2=1, y1=35, y2=0, y3=16] [L36] EXPR counter++ VAL [counter=36, counter++=35, x1=51, x2=1, y1=35, y2=0, y3=16] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=36] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=36, x1=51, x2=1, y1=35, y2=0, y3=16] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=36, x1=51, x2=1, y1=35, y2=0, y3=16] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=36, x1=51, x2=1, y1=36, y2=0, y3=15] [L36] EXPR counter++ VAL [counter=37, counter++=36, x1=51, x2=1, y1=36, y2=0, y3=15] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=37] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=37, x1=51, x2=1, y1=36, y2=0, y3=15] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=37, x1=51, x2=1, y1=36, y2=0, y3=15] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=37, x1=51, x2=1, y1=37, y2=0, y3=14] [L36] EXPR counter++ VAL [counter=38, counter++=37, x1=51, x2=1, y1=37, y2=0, y3=14] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=38] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=38, x1=51, x2=1, y1=37, y2=0, y3=14] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=38, x1=51, x2=1, y1=37, y2=0, y3=14] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=38, x1=51, x2=1, y1=38, y2=0, y3=13] [L36] EXPR counter++ VAL [counter=39, counter++=38, x1=51, x2=1, y1=38, y2=0, y3=13] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=39] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=39, x1=51, x2=1, y1=38, y2=0, y3=13] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=39, x1=51, x2=1, y1=38, y2=0, y3=13] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=39, x1=51, x2=1, y1=39, y2=0, y3=12] [L36] EXPR counter++ VAL [counter=40, counter++=39, x1=51, x2=1, y1=39, y2=0, y3=12] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=40] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=40, x1=51, x2=1, y1=39, y2=0, y3=12] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=40, x1=51, x2=1, y1=39, y2=0, y3=12] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=40, x1=51, x2=1, y1=40, y2=0, y3=11] [L36] EXPR counter++ VAL [counter=41, counter++=40, x1=51, x2=1, y1=40, y2=0, y3=11] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=41] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=41, x1=51, x2=1, y1=40, y2=0, y3=11] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=41, x1=51, x2=1, y1=40, y2=0, y3=11] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=41, x1=51, x2=1, y1=41, y2=0, y3=10] [L36] EXPR counter++ VAL [counter=42, counter++=41, x1=51, x2=1, y1=41, y2=0, y3=10] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=42] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=42, x1=51, x2=1, y1=41, y2=0, y3=10] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=42, x1=51, x2=1, y1=41, y2=0, y3=10] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=42, x1=51, x2=1, y1=42, y2=0, y3=9] [L36] EXPR counter++ VAL [counter=43, counter++=42, x1=51, x2=1, y1=42, y2=0, y3=9] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=43] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=43, x1=51, x2=1, y1=42, y2=0, y3=9] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=43, x1=51, x2=1, y1=42, y2=0, y3=9] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=43, x1=51, x2=1, y1=43, y2=0, y3=8] [L36] EXPR counter++ VAL [counter=44, counter++=43, x1=51, x2=1, y1=43, y2=0, y3=8] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=44] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=44, x1=51, x2=1, y1=43, y2=0, y3=8] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=44, x1=51, x2=1, y1=43, y2=0, y3=8] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=44, x1=51, x2=1, y1=44, y2=0, y3=7] [L36] EXPR counter++ VAL [counter=45, counter++=44, x1=51, x2=1, y1=44, y2=0, y3=7] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=45] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=45, x1=51, x2=1, y1=44, y2=0, y3=7] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=45, x1=51, x2=1, y1=44, y2=0, y3=7] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=45, x1=51, x2=1, y1=45, y2=0, y3=6] [L36] EXPR counter++ VAL [counter=46, counter++=45, x1=51, x2=1, y1=45, y2=0, y3=6] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=46] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=46, x1=51, x2=1, y1=45, y2=0, y3=6] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=46, x1=51, x2=1, y1=45, y2=0, y3=6] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=46, x1=51, x2=1, y1=46, y2=0, y3=5] [L36] EXPR counter++ VAL [counter=47, counter++=46, x1=51, x2=1, y1=46, y2=0, y3=5] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=47] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=47, x1=51, x2=1, y1=46, y2=0, y3=5] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=47, x1=51, x2=1, y1=46, y2=0, y3=5] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=47, x1=51, x2=1, y1=47, y2=0, y3=4] [L36] EXPR counter++ VAL [counter=48, counter++=47, x1=51, x2=1, y1=47, y2=0, y3=4] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=48] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=48, x1=51, x2=1, y1=47, y2=0, y3=4] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=48, x1=51, x2=1, y1=47, y2=0, y3=4] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=48, x1=51, x2=1, y1=48, y2=0, y3=3] [L36] EXPR counter++ VAL [counter=49, counter++=48, x1=51, x2=1, y1=48, y2=0, y3=3] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=49] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=49, x1=51, x2=1, y1=48, y2=0, y3=3] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=49, x1=51, x2=1, y1=48, y2=0, y3=3] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=49, x1=51, x2=1, y1=49, y2=0, y3=2] [L36] EXPR counter++ VAL [counter=50, counter++=49, x1=51, x2=1, y1=49, y2=0, y3=2] [L36] COND TRUE counter++<50 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=50] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=50, x1=51, x2=1, y1=49, y2=0, y3=2] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=50, x1=51, x2=1, y1=49, y2=0, y3=2] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=50, x1=51, x2=1, y1=50, y2=0, y3=1] [L36] EXPR counter++ VAL [counter=51, counter++=50, x1=51, x2=1, y1=50, y2=0, y3=1] [L36] COND FALSE !(counter++<50) [L50] CALL __VERIFIER_assert(y1*x2 + y2 == x1) VAL [\old(cond)=0, counter=51] [L16] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=51] [L18] reach_error() VAL [\old(cond)=0, cond=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.8s, OverallIterations: 10, TraceHistogramMax: 51, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1681 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1678 mSDsluCounter, 1781 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1459 mSDsCounter, 503 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 981 IncrementalHoareTripleChecker+Invalid, 1484 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 503 mSolverCounterUnsat, 322 mSDtfsCounter, 981 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1898 GetRequests, 1605 SyntacticMatches, 2 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2930 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=466occurred in iteration=9, InterpolantAutomatonStates: 297, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 1392 NumberOfCodeBlocks, 1392 NumberOfCodeBlocksAsserted, 118 NumberOfCheckSat, 1775 ConstructedInterpolants, 0 QuantifiedInterpolants, 4489 SizeOfPredicates, 93 NumberOfNonLiveVariables, 2472 ConjunctsInSsa, 210 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 5662/24434 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-21 04:04:02,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE