./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5317dae 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/fermat2-ll_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 a367fffaabe322cc88315ee22f1c9c69606de0332ddd62ff36608ec1e5019dc8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 02:08:48,267 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 02:08:48,269 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 02:08:48,303 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 02:08:48,304 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 02:08:48,306 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 02:08:48,308 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 02:08:48,309 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 02:08:48,311 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 02:08:48,316 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 02:08:48,317 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 02:08:48,318 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 02:08:48,318 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 02:08:48,319 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 02:08:48,320 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 02:08:48,322 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 02:08:48,323 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 02:08:48,323 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 02:08:48,325 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 02:08:48,326 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 02:08:48,328 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 02:08:48,330 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 02:08:48,331 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 02:08:48,331 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 02:08:48,333 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 02:08:48,335 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 02:08:48,335 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 02:08:48,335 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 02:08:48,336 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 02:08:48,337 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 02:08:48,338 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 02:08:48,338 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 02:08:48,339 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 02:08:48,340 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 02:08:48,341 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 02:08:48,341 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 02:08:48,341 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 02:08:48,341 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 02:08:48,341 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 02:08:48,343 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 02:08:48,344 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 02:08:48,345 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-16 02:08:48,363 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 02:08:48,366 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 02:08:48,367 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 02:08:48,367 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 02:08:48,367 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 02:08:48,367 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 02:08:48,368 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 02:08:48,368 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 02:08:48,368 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 02:08:48,368 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 02:08:48,369 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 02:08:48,369 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 02:08:48,369 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 02:08:48,370 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 02:08:48,370 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 02:08:48,370 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 02:08:48,370 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 02:08:48,370 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 02:08:48,370 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 02:08:48,370 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 02:08:48,370 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 02:08:48,371 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 02:08:48,371 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 02:08:48,371 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 02:08:48,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 02:08:48,371 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 02:08:48,371 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 02:08:48,371 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 02:08:48,372 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 02:08:48,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 02:08:48,372 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 02:08:48,372 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 02:08:48,372 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 02:08:48,372 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 02:08:48,373 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 02:08:48,373 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a367fffaabe322cc88315ee22f1c9c69606de0332ddd62ff36608ec1e5019dc8 [2023-02-16 02:08:48,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 02:08:48,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 02:08:48,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 02:08:48,633 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 02:08:48,634 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 02:08:48,635 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound50.c [2023-02-16 02:08:49,582 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 02:08:49,741 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 02:08:49,742 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound50.c [2023-02-16 02:08:49,748 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/688d8339b/5c32fa47c06345588f9ee6c5fbe58211/FLAG9f0074b2c [2023-02-16 02:08:49,761 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/688d8339b/5c32fa47c06345588f9ee6c5fbe58211 [2023-02-16 02:08:49,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 02:08:49,764 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 02:08:49,765 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 02:08:49,765 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 02:08:49,768 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 02:08:49,768 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 02:08:49" (1/1) ... [2023-02-16 02:08:49,769 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1489bbb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:08:49, skipping insertion in model container [2023-02-16 02:08:49,769 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 02:08:49" (1/1) ... [2023-02-16 02:08:49,775 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 02:08:49,791 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 02:08:49,884 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound50.c[524,537] [2023-02-16 02:08:49,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 02:08:49,902 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 02:08:49,909 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound50.c[524,537] [2023-02-16 02:08:49,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 02:08:49,921 INFO L208 MainTranslator]: Completed translation [2023-02-16 02:08:49,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:08:49 WrapperNode [2023-02-16 02:08:49,922 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 02:08:49,923 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 02:08:49,923 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 02:08:49,923 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 02:08:49,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:08:49" (1/1) ... [2023-02-16 02:08:49,931 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:08:49" (1/1) ... [2023-02-16 02:08:49,940 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2023-02-16 02:08:49,941 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 02:08:49,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 02:08:49,941 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 02:08:49,941 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 02:08:49,947 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:08:49" (1/1) ... [2023-02-16 02:08:49,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:08:49" (1/1) ... [2023-02-16 02:08:49,948 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:08:49" (1/1) ... [2023-02-16 02:08:49,948 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:08:49" (1/1) ... [2023-02-16 02:08:49,950 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:08:49" (1/1) ... [2023-02-16 02:08:49,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:08:49" (1/1) ... [2023-02-16 02:08:49,952 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:08:49" (1/1) ... [2023-02-16 02:08:49,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:08:49" (1/1) ... [2023-02-16 02:08:49,953 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 02:08:49,954 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 02:08:49,954 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 02:08:49,954 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 02:08:49,955 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:08:49" (1/1) ... [2023-02-16 02:08:49,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 02:08:49,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:08:49,983 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-16 02:08:50,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-16 02:08:50,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 02:08:50,026 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-16 02:08:50,027 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-16 02:08:50,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 02:08:50,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 02:08:50,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 02:08:50,028 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-16 02:08:50,028 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-16 02:08:50,072 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 02:08:50,073 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 02:08:50,241 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 02:08:50,253 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 02:08:50,254 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-16 02:08:50,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 02:08:50 BoogieIcfgContainer [2023-02-16 02:08:50,255 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 02:08:50,256 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 02:08:50,257 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 02:08:50,259 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 02:08:50,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 02:08:49" (1/3) ... [2023-02-16 02:08:50,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f4b9fbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 02:08:50, skipping insertion in model container [2023-02-16 02:08:50,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:08:49" (2/3) ... [2023-02-16 02:08:50,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f4b9fbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 02:08:50, skipping insertion in model container [2023-02-16 02:08:50,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 02:08:50" (3/3) ... [2023-02-16 02:08:50,274 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound50.c [2023-02-16 02:08:50,285 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 02:08:50,300 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 02:08:50,331 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 02:08:50,336 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@757c8107, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 02:08:50,337 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 02:08:50,339 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) [2023-02-16 02:08:50,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-16 02:08:50,344 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:08:50,344 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 02:08:50,344 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:08:50,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:08:50,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1086166160, now seen corresponding path program 1 times [2023-02-16 02:08:50,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:08:50,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316651184] [2023-02-16 02:08:50,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:08:50,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:08:50,406 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 02:08:50,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1801598715] [2023-02-16 02:08:50,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:08:50,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:08:50,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:08:50,414 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 02:08:50,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-16 02:08:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:08:50,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-16 02:08:50,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:08:50,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 02:08:50,502 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 02:08:50,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:08:50,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316651184] [2023-02-16 02:08:50,503 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 02:08:50,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801598715] [2023-02-16 02:08:50,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801598715] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 02:08:50,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 02:08:50,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 02:08:50,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166437835] [2023-02-16 02:08:50,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 02:08:50,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 02:08:50,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:08:50,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 02:08:50,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 02:08:50,530 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 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2023-02-16 02:08:50,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:08:50,547 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2023-02-16 02:08:50,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 02:08:50,549 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 [2023-02-16 02:08:50,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:08:50,555 INFO L225 Difference]: With dead ends: 47 [2023-02-16 02:08:50,556 INFO L226 Difference]: Without dead ends: 21 [2023-02-16 02:08:50,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 02:08:50,563 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 [2023-02-16 02:08:50,565 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] [2023-02-16 02:08:50,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-02-16 02:08:50,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-02-16 02:08:50,590 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) [2023-02-16 02:08:50,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-02-16 02:08:50,591 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 18 [2023-02-16 02:08:50,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:08:50,591 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-02-16 02:08:50,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2023-02-16 02:08:50,592 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-02-16 02:08:50,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-16 02:08:50,593 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:08:50,593 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 02:08:50,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-16 02:08:50,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-02-16 02:08:50,798 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:08:50,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:08:50,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1345709874, now seen corresponding path program 1 times [2023-02-16 02:08:50,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:08:50,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226653032] [2023-02-16 02:08:50,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:08:50,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:08:50,826 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 02:08:50,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [184934805] [2023-02-16 02:08:50,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:08:50,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:08:50,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:08:50,829 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 02:08:50,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-16 02:08:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:08:50,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 02:08:50,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:08:50,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 02:08:50,960 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 02:08:50,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:08:50,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226653032] [2023-02-16 02:08:50,961 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 02:08:50,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184934805] [2023-02-16 02:08:50,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184934805] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 02:08:50,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 02:08:50,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 02:08:50,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962938216] [2023-02-16 02:08:50,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 02:08:50,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 02:08:50,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:08:50,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 02:08:50,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 02:08:50,967 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) [2023-02-16 02:08:50,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:08:50,982 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2023-02-16 02:08:50,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 02:08:50,983 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 [2023-02-16 02:08:50,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:08:50,984 INFO L225 Difference]: With dead ends: 30 [2023-02-16 02:08:50,985 INFO L226 Difference]: Without dead ends: 23 [2023-02-16 02:08:50,985 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 [2023-02-16 02:08:50,986 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 [2023-02-16 02:08:50,987 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] [2023-02-16 02:08:50,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-16 02:08:50,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-16 02:08:50,992 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) [2023-02-16 02:08:50,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-02-16 02:08:50,993 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 19 [2023-02-16 02:08:50,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:08:50,994 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-02-16 02:08:50,994 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) [2023-02-16 02:08:50,994 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-02-16 02:08:50,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-16 02:08:50,995 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:08:50,995 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 02:08:51,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-16 02:08:51,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-02-16 02:08:51,200 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:08:51,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:08:51,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1347497334, now seen corresponding path program 1 times [2023-02-16 02:08:51,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:08:51,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728216809] [2023-02-16 02:08:51,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:08:51,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:08:51,215 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 02:08:51,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [285764218] [2023-02-16 02:08:51,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:08:51,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:08:51,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:08:51,220 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 02:08:51,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-16 02:08:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:08:51,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-16 02:08:51,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:08:51,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 02:08:51,317 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 02:08:51,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:08:51,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728216809] [2023-02-16 02:08:51,317 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 02:08:51,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285764218] [2023-02-16 02:08:51,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285764218] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 02:08:51,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 02:08:51,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 02:08:51,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982630467] [2023-02-16 02:08:51,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 02:08:51,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 02:08:51,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:08:51,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 02:08:51,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 02:08:51,320 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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) [2023-02-16 02:08:54,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-16 02:08:54,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:08:54,481 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2023-02-16 02:08:54,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 02:08:54,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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 [2023-02-16 02:08:54,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:08:54,485 INFO L225 Difference]: With dead ends: 33 [2023-02-16 02:08:54,485 INFO L226 Difference]: Without dead ends: 31 [2023-02-16 02:08:54,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 02:08:54,486 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 7 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-02-16 02:08:54,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 66 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2023-02-16 02:08:54,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-16 02:08:54,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2023-02-16 02:08:54,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) [2023-02-16 02:08:54,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2023-02-16 02:08:54,493 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2023-02-16 02:08:54,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:08:54,493 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2023-02-16 02:08:54,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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) [2023-02-16 02:08:54,493 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2023-02-16 02:08:54,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-16 02:08:54,494 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:08:54,494 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] [2023-02-16 02:08:54,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-16 02:08:54,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:08:54,699 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:08:54,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:08:54,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1636478750, now seen corresponding path program 1 times [2023-02-16 02:08:54,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:08:54,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806375997] [2023-02-16 02:08:54,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:08:54,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:08:54,713 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 02:08:54,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [820829257] [2023-02-16 02:08:54,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:08:54,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:08:54,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:08:54,714 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 02:08:54,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-16 02:08:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:08:54,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-16 02:08:54,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:08:54,819 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 02:08:54,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:08:54,909 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 02:08:54,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:08:54,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806375997] [2023-02-16 02:08:54,909 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 02:08:54,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820829257] [2023-02-16 02:08:54,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820829257] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 02:08:54,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 02:08:54,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2023-02-16 02:08:54,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016821484] [2023-02-16 02:08:54,910 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 02:08:54,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 02:08:54,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:08:54,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 02:08:54,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-02-16 02:08:54,912 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-16 02:08:55,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:08:55,072 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2023-02-16 02:08:55,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 02:08:55,073 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 25 [2023-02-16 02:08:55,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:08:55,075 INFO L225 Difference]: With dead ends: 35 [2023-02-16 02:08:55,075 INFO L226 Difference]: Without dead ends: 30 [2023-02-16 02:08:55,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-02-16 02:08:55,078 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 02:08:55,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 101 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 02:08:55,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-16 02:08:55,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2023-02-16 02:08:55,083 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) [2023-02-16 02:08:55,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2023-02-16 02:08:55,083 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 25 [2023-02-16 02:08:55,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:08:55,083 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2023-02-16 02:08:55,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-16 02:08:55,084 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2023-02-16 02:08:55,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-16 02:08:55,084 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:08:55,084 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] [2023-02-16 02:08:55,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-16 02:08:55,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:08:55,285 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:08:55,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:08:55,285 INFO L85 PathProgramCache]: Analyzing trace with hash -126969667, now seen corresponding path program 1 times [2023-02-16 02:08:55,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:08:55,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807424472] [2023-02-16 02:08:55,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:08:55,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:08:55,295 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 02:08:55,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1845732888] [2023-02-16 02:08:55,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:08:55,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:08:55,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:08:55,298 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 02:08:55,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-16 02:08:55,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:08:55,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 02:08:55,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:08:55,380 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 02:08:55,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:08:55,421 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 02:08:55,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:08:55,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807424472] [2023-02-16 02:08:55,422 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 02:08:55,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845732888] [2023-02-16 02:08:55,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845732888] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 02:08:55,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 02:08:55,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-02-16 02:08:55,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970334869] [2023-02-16 02:08:55,423 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 02:08:55,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 02:08:55,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:08:55,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 02:08:55,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-16 02:08:55,424 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) [2023-02-16 02:08:55,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:08:55,472 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2023-02-16 02:08:55,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 02:08:55,472 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 [2023-02-16 02:08:55,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:08:55,473 INFO L225 Difference]: With dead ends: 57 [2023-02-16 02:08:55,473 INFO L226 Difference]: Without dead ends: 52 [2023-02-16 02:08:55,474 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 [2023-02-16 02:08:55,474 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 20 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 02:08:55,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 101 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 02:08:55,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-16 02:08:55,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-02-16 02:08:55,496 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) [2023-02-16 02:08:55,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2023-02-16 02:08:55,499 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 28 [2023-02-16 02:08:55,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:08:55,499 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2023-02-16 02:08:55,499 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) [2023-02-16 02:08:55,500 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2023-02-16 02:08:55,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-16 02:08:55,503 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:08:55,503 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] [2023-02-16 02:08:55,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-16 02:08:55,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:08:55,708 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:08:55,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:08:55,713 INFO L85 PathProgramCache]: Analyzing trace with hash 972990450, now seen corresponding path program 2 times [2023-02-16 02:08:55,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:08:55,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077077240] [2023-02-16 02:08:55,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:08:55,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:08:55,721 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 02:08:55,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [601473680] [2023-02-16 02:08:55,721 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 02:08:55,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:08:55,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:08:55,722 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 02:08:55,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-16 02:08:55,789 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 02:08:55,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 02:08:55,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-16 02:08:55,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:08:55,913 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 02:08:55,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:08:56,001 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-02-16 02:08:56,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:08:56,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077077240] [2023-02-16 02:08:56,001 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 02:08:56,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601473680] [2023-02-16 02:08:56,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601473680] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 02:08:56,001 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 02:08:56,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-02-16 02:08:56,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979167060] [2023-02-16 02:08:56,002 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 02:08:56,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 02:08:56,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:08:56,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 02:08:56,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-02-16 02:08:56,003 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) [2023-02-16 02:08:56,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:08:56,120 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2023-02-16 02:08:56,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-16 02:08:56,120 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 [2023-02-16 02:08:56,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:08:56,121 INFO L225 Difference]: With dead ends: 111 [2023-02-16 02:08:56,121 INFO L226 Difference]: Without dead ends: 106 [2023-02-16 02:08:56,121 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 [2023-02-16 02:08:56,122 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 70 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 02:08:56,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 155 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 02:08:56,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-02-16 02:08:56,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-02-16 02:08:56,137 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) [2023-02-16 02:08:56,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2023-02-16 02:08:56,138 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 55 [2023-02-16 02:08:56,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:08:56,138 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2023-02-16 02:08:56,138 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) [2023-02-16 02:08:56,138 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2023-02-16 02:08:56,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-02-16 02:08:56,139 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:08:56,139 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] [2023-02-16 02:08:56,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-16 02:08:56,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:08:56,344 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:08:56,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:08:56,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1909967598, now seen corresponding path program 3 times [2023-02-16 02:08:56,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:08:56,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002082729] [2023-02-16 02:08:56,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:08:56,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:08:56,353 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 02:08:56,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [652505442] [2023-02-16 02:08:56,353 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 02:08:56,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:08:56,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:08:56,354 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 02:08:56,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-16 02:09:28,877 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-02-16 02:09:28,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 02:09:28,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-16 02:09:28,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:09:29,086 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 02:09:29,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:09:29,354 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2023-02-16 02:09:29,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:09:29,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002082729] [2023-02-16 02:09:29,355 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 02:09:29,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652505442] [2023-02-16 02:09:29,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652505442] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 02:09:29,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 02:09:29,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2023-02-16 02:09:29,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379316842] [2023-02-16 02:09:29,355 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 02:09:29,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-16 02:09:29,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:09:29,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-16 02:09:29,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2023-02-16 02:09:29,360 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) [2023-02-16 02:09:29,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:09:29,770 INFO L93 Difference]: Finished difference Result 219 states and 253 transitions. [2023-02-16 02:09:29,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-02-16 02:09:29,771 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 [2023-02-16 02:09:29,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:09:29,773 INFO L225 Difference]: With dead ends: 219 [2023-02-16 02:09:29,773 INFO L226 Difference]: Without dead ends: 214 [2023-02-16 02:09:29,773 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 [2023-02-16 02:09:29,774 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 135 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 02:09:29,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 237 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 02:09:29,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2023-02-16 02:09:29,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2023-02-16 02:09:29,803 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) [2023-02-16 02:09:29,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 237 transitions. [2023-02-16 02:09:29,804 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 237 transitions. Word has length 109 [2023-02-16 02:09:29,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:09:29,805 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 237 transitions. [2023-02-16 02:09:29,805 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) [2023-02-16 02:09:29,805 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 237 transitions. [2023-02-16 02:09:29,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2023-02-16 02:09:29,807 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:09:29,807 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] [2023-02-16 02:09:29,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-16 02:09:30,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:09:30,035 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:09:30,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:09:30,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1216739502, now seen corresponding path program 4 times [2023-02-16 02:09:30,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:09:30,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20158272] [2023-02-16 02:09:30,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:09:30,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:09:30,059 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 02:09:30,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1829760508] [2023-02-16 02:09:30,060 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-16 02:09:30,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:09:30,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:09:30,077 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) [2023-02-16 02:09:30,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-16 02:09:30,211 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-16 02:09:30,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 02:09:30,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 47 conjunts are in the unsatisfiable core [2023-02-16 02:09:30,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:09:30,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 44 proven. 2123 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 02:09:30,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:09:31,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 44 proven. 1199 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked. [2023-02-16 02:09:31,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:09:31,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20158272] [2023-02-16 02:09:31,381 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 02:09:31,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829760508] [2023-02-16 02:09:31,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829760508] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 02:09:31,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 02:09:31,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2023-02-16 02:09:31,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125618429] [2023-02-16 02:09:31,382 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 02:09:31,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-02-16 02:09:31,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:09:31,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-16 02:09:31,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2023-02-16 02:09:31,385 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) [2023-02-16 02:09:32,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:09:32,603 INFO L93 Difference]: Finished difference Result 435 states and 505 transitions. [2023-02-16 02:09:32,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2023-02-16 02:09:32,604 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 [2023-02-16 02:09:32,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:09:32,606 INFO L225 Difference]: With dead ends: 435 [2023-02-16 02:09:32,606 INFO L226 Difference]: Without dead ends: 430 [2023-02-16 02:09:32,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2023-02-16 02:09:32,609 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 359 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 02:09:32,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 434 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 02:09:32,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2023-02-16 02:09:32,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2023-02-16 02:09:32,637 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) [2023-02-16 02:09:32,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 477 transitions. [2023-02-16 02:09:32,638 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 477 transitions. Word has length 217 [2023-02-16 02:09:32,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:09:32,639 INFO L495 AbstractCegarLoop]: Abstraction has 430 states and 477 transitions. [2023-02-16 02:09:32,639 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) [2023-02-16 02:09:32,639 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 477 transitions. [2023-02-16 02:09:32,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2023-02-16 02:09:32,643 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:09:32,644 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] [2023-02-16 02:09:32,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-16 02:09:32,850 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,SelfDestructingSolverStorable7 [2023-02-16 02:09:32,850 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:09:32,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:09:32,851 INFO L85 PathProgramCache]: Analyzing trace with hash -623866926, now seen corresponding path program 5 times [2023-02-16 02:09:32,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:09:32,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066931032] [2023-02-16 02:09:32,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:09:32,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:09:32,865 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 02:09:32,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [471210273] [2023-02-16 02:09:32,866 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-16 02:09:32,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:09:32,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:09:32,867 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) [2023-02-16 02:09:32,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-16 02:09:33,421 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2023-02-16 02:09:33,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 02:09:33,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 989 conjuncts, 95 conjunts are in the unsatisfiable core [2023-02-16 02:09:33,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:09:34,494 INFO L134 CoverageAnalysis]: Checked inductivity of 9503 backedges. 92 proven. 9407 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 02:09:34,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:09:35,582 INFO L134 CoverageAnalysis]: Checked inductivity of 9503 backedges. 92 proven. 5267 refuted. 0 times theorem prover too weak. 4144 trivial. 0 not checked. [2023-02-16 02:09:35,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:09:35,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066931032] [2023-02-16 02:09:35,582 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 02:09:35,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471210273] [2023-02-16 02:09:35,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471210273] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 02:09:35,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 02:09:35,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 54 [2023-02-16 02:09:35,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364997115] [2023-02-16 02:09:35,582 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 02:09:35,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-02-16 02:09:35,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:09:35,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-02-16 02:09:35,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2023-02-16 02:09:35,585 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) [2023-02-16 02:09:36,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:09:36,795 INFO L93 Difference]: Finished difference Result 471 states and 525 transitions. [2023-02-16 02:09:36,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2023-02-16 02:09:36,795 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 [2023-02-16 02:09:36,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:09:36,805 INFO L225 Difference]: With dead ends: 471 [2023-02-16 02:09:36,829 INFO L226 Difference]: Without dead ends: 466 [2023-02-16 02:09:36,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 913 GetRequests, 768 SyntacticMatches, 44 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2350 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3926, Invalid=6580, Unknown=0, NotChecked=0, Total=10506 [2023-02-16 02:09:36,833 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 199 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 02:09:36,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 461 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 02:09:36,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2023-02-16 02:09:36,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2023-02-16 02:09:36,884 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) [2023-02-16 02:09:36,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 517 transitions. [2023-02-16 02:09:36,887 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 517 transitions. Word has length 433 [2023-02-16 02:09:36,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:09:36,887 INFO L495 AbstractCegarLoop]: Abstraction has 466 states and 517 transitions. [2023-02-16 02:09:36,888 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) [2023-02-16 02:09:36,896 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 517 transitions. [2023-02-16 02:09:36,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2023-02-16 02:09:36,901 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:09:36,901 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] [2023-02-16 02:09:36,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-02-16 02:09:37,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:09:37,106 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:09:37,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:09:37,106 INFO L85 PathProgramCache]: Analyzing trace with hash -872711022, now seen corresponding path program 6 times [2023-02-16 02:09:37,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:09:37,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664046716] [2023-02-16 02:09:37,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:09:37,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:09:37,122 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 02:09:37,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [694321724] [2023-02-16 02:09:37,130 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-16 02:09:37,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:09:37,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:09:37,131 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 02:09:37,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-16 02:12:40,138 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2023-02-16 02:12:40,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-16 02:12:40,138 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 02:12:40,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 02:12:40,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 02:12:40,474 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-16 02:12:40,475 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-16 02:12:40,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-16 02:12:40,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-16 02:12:40,697 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1] [2023-02-16 02:12:40,700 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-16 02:12:40,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.02 02:12:40 BoogieIcfgContainer [2023-02-16 02:12:40,810 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-16 02:12:40,811 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-16 02:12:40,811 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-16 02:12:40,811 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-16 02:12:40,811 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 02:08:50" (3/4) ... [2023-02-16 02:12:40,813 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-16 02:12:40,928 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-16 02:12:40,929 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-16 02:12:40,929 INFO L158 Benchmark]: Toolchain (without parser) took 231164.61ms. Allocated memory was 121.6MB in the beginning and 146.8MB in the end (delta: 25.2MB). Free memory was 83.6MB in the beginning and 61.1MB in the end (delta: 22.5MB). Peak memory consumption was 46.5MB. Max. memory is 16.1GB. [2023-02-16 02:12:40,929 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 100.7MB. Free memory is still 75.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 02:12:40,930 INFO L158 Benchmark]: CACSL2BoogieTranslator took 156.83ms. Allocated memory is still 121.6MB. Free memory was 83.2MB in the beginning and 72.8MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-16 02:12:40,930 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.15ms. Allocated memory is still 121.6MB. Free memory was 72.8MB in the beginning and 71.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 02:12:40,930 INFO L158 Benchmark]: Boogie Preprocessor took 12.44ms. Allocated memory is still 121.6MB. Free memory was 71.5MB in the beginning and 70.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 02:12:40,930 INFO L158 Benchmark]: RCFGBuilder took 301.20ms. Allocated memory is still 121.6MB. Free memory was 70.1MB in the beginning and 91.3MB in the end (delta: -21.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-16 02:12:40,931 INFO L158 Benchmark]: TraceAbstraction took 230553.61ms. Allocated memory was 121.6MB in the beginning and 146.8MB in the end (delta: 25.2MB). Free memory was 90.3MB in the beginning and 76.8MB in the end (delta: 13.5MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. [2023-02-16 02:12:40,931 INFO L158 Benchmark]: Witness Printer took 118.08ms. Allocated memory is still 146.8MB. Free memory was 76.8MB in the beginning and 61.1MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-16 02:12:40,932 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.08ms. Allocated memory is still 100.7MB. Free memory is still 75.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 156.83ms. Allocated memory is still 121.6MB. Free memory was 83.2MB in the beginning and 72.8MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.15ms. Allocated memory is still 121.6MB. Free memory was 72.8MB in the beginning and 71.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 12.44ms. Allocated memory is still 121.6MB. Free memory was 71.5MB in the beginning and 70.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 301.20ms. Allocated memory is still 121.6MB. Free memory was 70.1MB in the beginning and 91.3MB in the end (delta: -21.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 230553.61ms. Allocated memory was 121.6MB in the beginning and 146.8MB in the end (delta: 25.2MB). Free memory was 90.3MB in the beginning and 76.8MB in the end (delta: 13.5MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. * Witness Printer took 118.08ms. Allocated memory is still 146.8MB. Free memory was 76.8MB in the beginning and 61.1MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. 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: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; VAL [counter=0] [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L26] CALL assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L26] RET assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [A=1444807, counter=0, R=1203] [L28] CALL assume_abort_if_not(A % 2 == 1) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L28] RET assume_abort_if_not(A % 2 == 1) VAL [A=1444807, counter=0, R=1203] [L30] u = ((long long) 2 * R) + 1 [L31] v = 1 [L32] r = ((long long) R * R) - A VAL [A=1444807, counter=0, r=2402, R=1203, u=2407, v=1] [L34] EXPR counter++ VAL [A=1444807, counter=1, counter++=0, R=1203, r=2402, u=2407, v=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=1, R=1203, r=2402, u=2407, v=1] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=1, r=2402, R=1203, u=2407, v=1] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=1, r=2401, R=1203, u=2407, v=3] [L34] EXPR counter++ VAL [A=1444807, counter=2, counter++=1, R=1203, r=2401, u=2407, v=3] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=2, R=1203, r=2401, u=2407, v=3] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=2, R=1203, r=2401, u=2407, v=3] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=2, r=2398, R=1203, u=2407, v=5] [L34] EXPR counter++ VAL [A=1444807, counter=3, counter++=2, r=2398, R=1203, u=2407, v=5] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=3, r=2398, R=1203, u=2407, v=5] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=3, r=2398, R=1203, u=2407, v=5] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=3, r=2393, R=1203, u=2407, v=7] [L34] EXPR counter++ VAL [A=1444807, counter=4, counter++=3, r=2393, R=1203, u=2407, v=7] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=4, r=2393, R=1203, u=2407, v=7] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=4, r=2393, R=1203, u=2407, v=7] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=4, r=2386, R=1203, u=2407, v=9] [L34] EXPR counter++ VAL [A=1444807, counter=5, counter++=4, r=2386, R=1203, u=2407, v=9] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=5, R=1203, r=2386, u=2407, v=9] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=5, r=2386, R=1203, u=2407, v=9] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=5, r=2377, R=1203, u=2407, v=11] [L34] EXPR counter++ VAL [A=1444807, counter=6, counter++=5, r=2377, R=1203, u=2407, v=11] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=6] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=6, R=1203, r=2377, u=2407, v=11] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=6, R=1203, r=2377, u=2407, v=11] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=6, R=1203, r=2366, u=2407, v=13] [L34] EXPR counter++ VAL [A=1444807, counter=7, counter++=6, r=2366, R=1203, u=2407, v=13] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=7] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=7, R=1203, r=2366, u=2407, v=13] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=7, r=2366, R=1203, u=2407, v=13] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=7, r=2353, R=1203, u=2407, v=15] [L34] EXPR counter++ VAL [A=1444807, counter=8, counter++=7, R=1203, r=2353, u=2407, v=15] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=8] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=8, r=2353, R=1203, u=2407, v=15] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=8, R=1203, r=2353, u=2407, v=15] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=8, R=1203, r=2338, u=2407, v=17] [L34] EXPR counter++ VAL [A=1444807, counter=9, counter++=8, R=1203, r=2338, u=2407, v=17] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=9] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=9, R=1203, r=2338, u=2407, v=17] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=9, r=2338, R=1203, u=2407, v=17] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=9, R=1203, r=2321, u=2407, v=19] [L34] EXPR counter++ VAL [A=1444807, counter=10, counter++=9, r=2321, R=1203, u=2407, v=19] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=10] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=10, R=1203, r=2321, u=2407, v=19] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=10, R=1203, r=2321, u=2407, v=19] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=10, R=1203, r=2302, u=2407, v=21] [L34] EXPR counter++ VAL [A=1444807, counter=11, counter++=10, R=1203, r=2302, u=2407, v=21] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=11] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=11, r=2302, R=1203, u=2407, v=21] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=11, r=2302, R=1203, u=2407, v=21] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=11, r=2281, R=1203, u=2407, v=23] [L34] EXPR counter++ VAL [A=1444807, counter=12, counter++=11, r=2281, R=1203, u=2407, v=23] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=12] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=12, R=1203, r=2281, u=2407, v=23] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=12, R=1203, r=2281, u=2407, v=23] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=12, R=1203, r=2258, u=2407, v=25] [L34] EXPR counter++ VAL [A=1444807, counter=13, counter++=12, r=2258, R=1203, u=2407, v=25] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=13] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=13, R=1203, r=2258, u=2407, v=25] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=13, r=2258, R=1203, u=2407, v=25] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=13, r=2233, R=1203, u=2407, v=27] [L34] EXPR counter++ VAL [A=1444807, counter=14, counter++=13, r=2233, R=1203, u=2407, v=27] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=14] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=14, r=2233, R=1203, u=2407, v=27] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=14, r=2233, R=1203, u=2407, v=27] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=14, R=1203, r=2206, u=2407, v=29] [L34] EXPR counter++ VAL [A=1444807, counter=15, counter++=14, r=2206, R=1203, u=2407, v=29] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=15] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=15, R=1203, r=2206, u=2407, v=29] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=15, R=1203, r=2206, u=2407, v=29] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=15, R=1203, r=2177, u=2407, v=31] [L34] EXPR counter++ VAL [A=1444807, counter=16, counter++=15, r=2177, R=1203, u=2407, v=31] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=16] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=16, R=1203, r=2177, u=2407, v=31] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=16, r=2177, R=1203, u=2407, v=31] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=16, r=2146, R=1203, u=2407, v=33] [L34] EXPR counter++ VAL [A=1444807, counter=17, counter++=16, r=2146, R=1203, u=2407, v=33] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=17] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=17, r=2146, R=1203, u=2407, v=33] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=17, R=1203, r=2146, u=2407, v=33] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=17, r=2113, R=1203, u=2407, v=35] [L34] EXPR counter++ VAL [A=1444807, counter=18, counter++=17, R=1203, r=2113, u=2407, v=35] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=18] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=18, r=2113, R=1203, u=2407, v=35] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=18, r=2113, R=1203, u=2407, v=35] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=18, r=2078, R=1203, u=2407, v=37] [L34] EXPR counter++ VAL [A=1444807, counter=19, counter++=18, R=1203, r=2078, u=2407, v=37] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=19] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=19, R=1203, r=2078, u=2407, v=37] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=19, R=1203, r=2078, u=2407, v=37] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=19, R=1203, r=2041, u=2407, v=39] [L34] EXPR counter++ VAL [A=1444807, counter=20, counter++=19, r=2041, R=1203, u=2407, v=39] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=20] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=20, R=1203, r=2041, u=2407, v=39] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=20, r=2041, R=1203, u=2407, v=39] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=20, R=1203, r=2002, u=2407, v=41] [L34] EXPR counter++ VAL [A=1444807, counter=21, counter++=20, R=1203, r=2002, u=2407, v=41] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=21] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=21, R=1203, r=2002, u=2407, v=41] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=21, r=2002, R=1203, u=2407, v=41] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=21, r=1961, R=1203, u=2407, v=43] [L34] EXPR counter++ VAL [A=1444807, counter=22, counter++=21, R=1203, r=1961, u=2407, v=43] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=22] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=22, r=1961, R=1203, u=2407, v=43] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=22, r=1961, R=1203, u=2407, v=43] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=22, r=1918, R=1203, u=2407, v=45] [L34] EXPR counter++ VAL [A=1444807, counter=23, counter++=22, R=1203, r=1918, u=2407, v=45] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=23] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=23, r=1918, R=1203, u=2407, v=45] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=23, r=1918, R=1203, u=2407, v=45] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=23, r=1873, R=1203, u=2407, v=47] [L34] EXPR counter++ VAL [A=1444807, counter=24, counter++=23, R=1203, r=1873, u=2407, v=47] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=24] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=24, R=1203, r=1873, u=2407, v=47] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=24, R=1203, r=1873, u=2407, v=47] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=24, R=1203, r=1826, u=2407, v=49] [L34] EXPR counter++ VAL [A=1444807, counter=25, counter++=24, R=1203, r=1826, u=2407, v=49] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=25] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=25, R=1203, r=1826, u=2407, v=49] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=25, R=1203, r=1826, u=2407, v=49] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=25, R=1203, r=1777, u=2407, v=51] [L34] EXPR counter++ VAL [A=1444807, counter=26, counter++=25, R=1203, r=1777, u=2407, v=51] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=26] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=26, R=1203, r=1777, u=2407, v=51] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=26, r=1777, R=1203, u=2407, v=51] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=26, R=1203, r=1726, u=2407, v=53] [L34] EXPR counter++ VAL [A=1444807, counter=27, counter++=26, R=1203, r=1726, u=2407, v=53] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=27] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=27, r=1726, R=1203, u=2407, v=53] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=27, r=1726, R=1203, u=2407, v=53] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=27, R=1203, r=1673, u=2407, v=55] [L34] EXPR counter++ VAL [A=1444807, counter=28, counter++=27, r=1673, R=1203, u=2407, v=55] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=28] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=28, r=1673, R=1203, u=2407, v=55] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=28, r=1673, R=1203, u=2407, v=55] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=28, r=1618, R=1203, u=2407, v=57] [L34] EXPR counter++ VAL [A=1444807, counter=29, counter++=28, r=1618, R=1203, u=2407, v=57] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=29] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=29, R=1203, r=1618, u=2407, v=57] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=29, R=1203, r=1618, u=2407, v=57] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=29, r=1561, R=1203, u=2407, v=59] [L34] EXPR counter++ VAL [A=1444807, counter=30, counter++=29, r=1561, R=1203, u=2407, v=59] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=30] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=30, r=1561, R=1203, u=2407, v=59] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=30, R=1203, r=1561, u=2407, v=59] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=30, R=1203, r=1502, u=2407, v=61] [L34] EXPR counter++ VAL [A=1444807, counter=31, counter++=30, R=1203, r=1502, u=2407, v=61] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=31] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=31, R=1203, r=1502, u=2407, v=61] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=31, r=1502, R=1203, u=2407, v=61] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=31, r=1441, R=1203, u=2407, v=63] [L34] EXPR counter++ VAL [A=1444807, counter=32, counter++=31, r=1441, R=1203, u=2407, v=63] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=32] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=32, R=1203, r=1441, u=2407, v=63] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=32, r=1441, R=1203, u=2407, v=63] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=32, R=1203, r=1378, u=2407, v=65] [L34] EXPR counter++ VAL [A=1444807, counter=33, counter++=32, r=1378, R=1203, u=2407, v=65] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=33] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=33, r=1378, R=1203, u=2407, v=65] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=33, r=1378, R=1203, u=2407, v=65] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=33, R=1203, r=1313, u=2407, v=67] [L34] EXPR counter++ VAL [A=1444807, counter=34, counter++=33, r=1313, R=1203, u=2407, v=67] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=34] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=34, R=1203, r=1313, u=2407, v=67] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=34, r=1313, R=1203, u=2407, v=67] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=34, r=1246, R=1203, u=2407, v=69] [L34] EXPR counter++ VAL [A=1444807, counter=35, counter++=34, r=1246, R=1203, u=2407, v=69] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=35] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=35, R=1203, r=1246, u=2407, v=69] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=35, R=1203, r=1246, u=2407, v=69] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=35, r=1177, R=1203, u=2407, v=71] [L34] EXPR counter++ VAL [A=1444807, counter=36, counter++=35, r=1177, R=1203, u=2407, v=71] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=36] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=36, r=1177, R=1203, u=2407, v=71] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=36, r=1177, R=1203, u=2407, v=71] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=36, R=1203, r=1106, u=2407, v=73] [L34] EXPR counter++ VAL [A=1444807, counter=37, counter++=36, R=1203, r=1106, u=2407, v=73] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=37] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=37, r=1106, R=1203, u=2407, v=73] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=37, r=1106, R=1203, u=2407, v=73] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=37, R=1203, r=1033, u=2407, v=75] [L34] EXPR counter++ VAL [A=1444807, counter=38, counter++=37, R=1203, r=1033, u=2407, v=75] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=38] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=38, r=1033, R=1203, u=2407, v=75] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=38, r=1033, R=1203, u=2407, v=75] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=38, R=1203, r=958, u=2407, v=77] [L34] EXPR counter++ VAL [A=1444807, counter=39, counter++=38, r=958, R=1203, u=2407, v=77] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=39] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=39, R=1203, r=958, u=2407, v=77] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=39, R=1203, r=958, u=2407, v=77] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=39, R=1203, r=881, u=2407, v=79] [L34] EXPR counter++ VAL [A=1444807, counter=40, counter++=39, R=1203, r=881, u=2407, v=79] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=40] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=40, r=881, R=1203, u=2407, v=79] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=40, R=1203, r=881, u=2407, v=79] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=40, r=802, R=1203, u=2407, v=81] [L34] EXPR counter++ VAL [A=1444807, counter=41, counter++=40, r=802, R=1203, u=2407, v=81] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=41] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=41, R=1203, r=802, u=2407, v=81] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=41, r=802, R=1203, u=2407, v=81] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=41, R=1203, r=721, u=2407, v=83] [L34] EXPR counter++ VAL [A=1444807, counter=42, counter++=41, r=721, R=1203, u=2407, v=83] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=42] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=42, r=721, R=1203, u=2407, v=83] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=42, R=1203, r=721, u=2407, v=83] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=42, r=638, R=1203, u=2407, v=85] [L34] EXPR counter++ VAL [A=1444807, counter=43, counter++=42, r=638, R=1203, u=2407, v=85] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=43] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=43, R=1203, r=638, u=2407, v=85] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=43, R=1203, r=638, u=2407, v=85] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=43, R=1203, r=553, u=2407, v=87] [L34] EXPR counter++ VAL [A=1444807, counter=44, counter++=43, R=1203, r=553, u=2407, v=87] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=44] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=44, R=1203, r=553, u=2407, v=87] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=44, R=1203, r=553, u=2407, v=87] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=44, R=1203, r=466, u=2407, v=89] [L34] EXPR counter++ VAL [A=1444807, counter=45, counter++=44, r=466, R=1203, u=2407, v=89] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=45] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=45, r=466, R=1203, u=2407, v=89] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=45, R=1203, r=466, u=2407, v=89] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=45, r=377, R=1203, u=2407, v=91] [L34] EXPR counter++ VAL [A=1444807, counter=46, counter++=45, R=1203, r=377, u=2407, v=91] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=46] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=46, R=1203, r=377, u=2407, v=91] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=46, r=377, R=1203, u=2407, v=91] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=46, r=286, R=1203, u=2407, v=93] [L34] EXPR counter++ VAL [A=1444807, counter=47, counter++=46, r=286, R=1203, u=2407, v=93] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=47] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=47, r=286, R=1203, u=2407, v=93] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=47, R=1203, r=286, u=2407, v=93] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=47, R=1203, r=193, u=2407, v=95] [L34] EXPR counter++ VAL [A=1444807, counter=48, counter++=47, R=1203, r=193, u=2407, v=95] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=48] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=48, r=193, R=1203, u=2407, v=95] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=48, r=193, R=1203, u=2407, v=95] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=48, r=98, R=1203, u=2407, v=97] [L34] EXPR counter++ VAL [A=1444807, counter=49, counter++=48, r=98, R=1203, u=2407, v=97] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=49] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=49, R=1203, r=98, u=2407, v=97] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=49, R=1203, r=98, u=2407, v=97] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=49, r=1, R=1203, u=2407, v=99] [L34] EXPR counter++ VAL [A=1444807, counter=50, counter++=49, r=1, R=1203, u=2407, v=99] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=50] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1444807, counter=50, R=1203, r=1, u=2407, v=99] [L36] COND FALSE !(!(r != 0)) VAL [A=1444807, counter=50, r=1, R=1203, u=2407, v=99] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1444807, counter=50, R=1203, r=-98, u=2407, v=101] [L34] EXPR counter++ VAL [A=1444807, counter=51, counter++=50, r=-98, R=1203, u=2407, v=101] [L34] COND FALSE !(counter++<50) [L48] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, counter=51] [L12] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=51] [L14] 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: 230.4s, OverallIterations: 10, TraceHistogramMax: 51, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 811 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 810 mSDsluCounter, 1641 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1316 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 982 IncrementalHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 325 mSDtfsCounter, 982 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1906 GetRequests, 1574 SyntacticMatches, 45 SemanticMatches, 287 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3999 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=466occurred in iteration=9, InterpolantAutomatonStates: 293, 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, 216.1s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1392 NumberOfCodeBlocks, 1392 NumberOfCodeBlocksAsserted, 118 NumberOfCheckSat, 1775 ConstructedInterpolants, 0 QuantifiedInterpolants, 4519 SizeOfPredicates, 94 NumberOfNonLiveVariables, 2288 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! [2023-02-16 02:12:40,960 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