./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound20.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/cohencu-ll_unwindbound20.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 820aaba80b9c7e4ca2ad4a6a908bac2e6f59545dc6a131cb9fae6306b993a9eb --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 01:45:04,855 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 01:45:04,857 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 01:45:04,882 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 01:45:04,883 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 01:45:04,885 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 01:45:04,887 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 01:45:04,888 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 01:45:04,890 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 01:45:04,893 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 01:45:04,894 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 01:45:04,895 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 01:45:04,896 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 01:45:04,897 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 01:45:04,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 01:45:04,899 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 01:45:04,900 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 01:45:04,901 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 01:45:04,902 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 01:45:04,906 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 01:45:04,907 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 01:45:04,907 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 01:45:04,908 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 01:45:04,909 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 01:45:04,914 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 01:45:04,915 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 01:45:04,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 01:45:04,916 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 01:45:04,916 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 01:45:04,917 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 01:45:04,918 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 01:45:04,918 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 01:45:04,919 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 01:45:04,920 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 01:45:04,921 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 01:45:04,921 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 01:45:04,921 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 01:45:04,921 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 01:45:04,922 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 01:45:04,922 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 01:45:04,923 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 01:45:04,924 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-16 01:45:04,956 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 01:45:04,956 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 01:45:04,956 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 01:45:04,957 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 01:45:04,957 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 01:45:04,957 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 01:45:04,957 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 01:45:04,958 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 01:45:04,958 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 01:45:04,958 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 01:45:04,958 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 01:45:04,958 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 01:45:04,958 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 01:45:04,958 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 01:45:04,958 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 01:45:04,958 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 01:45:04,958 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 01:45:04,959 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 01:45:04,959 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 01:45:04,959 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 01:45:04,959 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 01:45:04,959 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 01:45:04,959 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 01:45:04,959 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 01:45:04,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 01:45:04,959 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 01:45:04,959 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 01:45:04,959 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 01:45:04,960 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 01:45:04,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 01:45:04,960 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 01:45:04,960 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 01:45:04,960 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 01:45:04,960 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 01:45:04,960 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 01:45:04,960 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 -> 820aaba80b9c7e4ca2ad4a6a908bac2e6f59545dc6a131cb9fae6306b993a9eb [2023-02-16 01:45:05,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 01:45:05,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 01:45:05,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 01:45:05,180 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 01:45:05,180 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 01:45:05,181 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound20.c [2023-02-16 01:45:06,223 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 01:45:06,377 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 01:45:06,377 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound20.c [2023-02-16 01:45:06,383 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ad13f53f/d3124553047b4425a9cb678e222b801d/FLAG6affce8f2 [2023-02-16 01:45:06,392 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ad13f53f/d3124553047b4425a9cb678e222b801d [2023-02-16 01:45:06,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 01:45:06,395 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 01:45:06,396 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 01:45:06,396 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 01:45:06,403 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 01:45:06,403 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 01:45:06" (1/1) ... [2023-02-16 01:45:06,404 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e9f9353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:45:06, skipping insertion in model container [2023-02-16 01:45:06,404 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 01:45:06" (1/1) ... [2023-02-16 01:45:06,408 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 01:45:06,417 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 01:45:06,508 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/cohencu-ll_unwindbound20.c[588,601] [2023-02-16 01:45:06,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 01:45:06,527 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 01:45:06,535 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/cohencu-ll_unwindbound20.c[588,601] [2023-02-16 01:45:06,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 01:45:06,555 INFO L208 MainTranslator]: Completed translation [2023-02-16 01:45:06,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:45:06 WrapperNode [2023-02-16 01:45:06,556 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 01:45:06,557 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 01:45:06,557 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 01:45:06,557 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 01:45:06,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:45:06" (1/1) ... [2023-02-16 01:45:06,565 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:45:06" (1/1) ... [2023-02-16 01:45:06,575 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 49 [2023-02-16 01:45:06,576 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 01:45:06,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 01:45:06,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 01:45:06,576 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 01:45:06,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:45:06" (1/1) ... [2023-02-16 01:45:06,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:45:06" (1/1) ... [2023-02-16 01:45:06,582 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:45:06" (1/1) ... [2023-02-16 01:45:06,582 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:45:06" (1/1) ... [2023-02-16 01:45:06,588 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:45:06" (1/1) ... [2023-02-16 01:45:06,590 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:45:06" (1/1) ... [2023-02-16 01:45:06,591 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:45:06" (1/1) ... [2023-02-16 01:45:06,591 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:45:06" (1/1) ... [2023-02-16 01:45:06,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 01:45:06,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 01:45:06,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 01:45:06,593 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 01:45:06,594 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:45:06" (1/1) ... [2023-02-16 01:45:06,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 01:45:06,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:45:06,619 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 01:45:06,639 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 01:45:06,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 01:45:06,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 01:45:06,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 01:45:06,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 01:45:06,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-16 01:45:06,649 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-16 01:45:06,694 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 01:45:06,696 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 01:45:06,843 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 01:45:06,852 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 01:45:06,852 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-16 01:45:06,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 01:45:06 BoogieIcfgContainer [2023-02-16 01:45:06,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 01:45:06,855 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 01:45:06,855 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 01:45:06,857 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 01:45:06,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 01:45:06" (1/3) ... [2023-02-16 01:45:06,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a517490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 01:45:06, skipping insertion in model container [2023-02-16 01:45:06,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:45:06" (2/3) ... [2023-02-16 01:45:06,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a517490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 01:45:06, skipping insertion in model container [2023-02-16 01:45:06,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 01:45:06" (3/3) ... [2023-02-16 01:45:06,859 INFO L112 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound20.c [2023-02-16 01:45:06,870 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 01:45:06,870 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 01:45:06,910 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 01:45:06,915 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;@7c7299ac, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 01:45:06,915 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 01:45:06,919 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-16 01:45:06,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-16 01:45:06,923 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:45:06,923 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:45:06,925 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:45:06,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:45:06,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1823967074, now seen corresponding path program 1 times [2023-02-16 01:45:06,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:45:06,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573822815] [2023-02-16 01:45:06,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:45:06,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:45:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:45:07,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:45:07,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:45:07,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573822815] [2023-02-16 01:45:07,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573822815] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 01:45:07,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 01:45:07,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 01:45:07,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675004880] [2023-02-16 01:45:07,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 01:45:07,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 01:45:07,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:45:07,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 01:45:07,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 01:45:07,106 INFO L87 Difference]: Start difference. First operand has 26 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:45:07,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:45:07,127 INFO L93 Difference]: Finished difference Result 50 states and 87 transitions. [2023-02-16 01:45:07,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 01:45:07,129 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-16 01:45:07,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:45:07,139 INFO L225 Difference]: With dead ends: 50 [2023-02-16 01:45:07,139 INFO L226 Difference]: Without dead ends: 22 [2023-02-16 01:45:07,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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 01:45:07,145 INFO L413 NwaCegarLoop]: 37 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, 37 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 01:45:07,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 01:45:07,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-02-16 01:45:07,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-02-16 01:45:07,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-16 01:45:07,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 33 transitions. [2023-02-16 01:45:07,170 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 33 transitions. Word has length 7 [2023-02-16 01:45:07,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:45:07,170 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 33 transitions. [2023-02-16 01:45:07,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:45:07,171 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. [2023-02-16 01:45:07,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-16 01:45:07,171 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:45:07,171 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:45:07,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 01:45:07,172 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:45:07,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:45:07,172 INFO L85 PathProgramCache]: Analyzing trace with hash 178926099, now seen corresponding path program 1 times [2023-02-16 01:45:07,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:45:07,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797107719] [2023-02-16 01:45:07,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:45:07,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:45:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:45:07,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:45:07,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:45:07,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797107719] [2023-02-16 01:45:07,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797107719] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 01:45:07,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 01:45:07,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 01:45:07,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692406961] [2023-02-16 01:45:07,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 01:45:07,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 01:45:07,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:45:07,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 01:45:07,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 01:45:07,244 INFO L87 Difference]: Start difference. First operand 22 states and 33 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:45:07,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:45:07,258 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2023-02-16 01:45:07,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 01:45:07,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-16 01:45:07,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:45:07,274 INFO L225 Difference]: With dead ends: 36 [2023-02-16 01:45:07,274 INFO L226 Difference]: Without dead ends: 24 [2023-02-16 01:45:07,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 01:45:07,275 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 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 01:45:07,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 01:45:07,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-02-16 01:45:07,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-02-16 01:45:07,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-16 01:45:07,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2023-02-16 01:45:07,281 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 8 [2023-02-16 01:45:07,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:45:07,282 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2023-02-16 01:45:07,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:45:07,282 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2023-02-16 01:45:07,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-16 01:45:07,282 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:45:07,283 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:45:07,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 01:45:07,283 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:45:07,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:45:07,283 INFO L85 PathProgramCache]: Analyzing trace with hash 180475231, now seen corresponding path program 1 times [2023-02-16 01:45:07,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:45:07,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803879008] [2023-02-16 01:45:07,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:45:07,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:45:07,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:45:07,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:45:07,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:45:07,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803879008] [2023-02-16 01:45:07,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803879008] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 01:45:07,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 01:45:07,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 01:45:07,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458039006] [2023-02-16 01:45:07,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 01:45:07,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 01:45:07,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:45:07,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 01:45:07,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 01:45:07,400 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:45:07,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:45:07,462 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2023-02-16 01:45:07,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 01:45:07,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-16 01:45:07,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:45:07,463 INFO L225 Difference]: With dead ends: 30 [2023-02-16 01:45:07,464 INFO L226 Difference]: Without dead ends: 28 [2023-02-16 01:45:07,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 01:45:07,465 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 8 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 01:45:07,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 62 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 01:45:07,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-16 01:45:07,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-02-16 01:45:07,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-16 01:45:07,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2023-02-16 01:45:07,474 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 8 [2023-02-16 01:45:07,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:45:07,475 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2023-02-16 01:45:07,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 01:45:07,475 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2023-02-16 01:45:07,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-16 01:45:07,476 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:45:07,476 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:45:07,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-16 01:45:07,476 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:45:07,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:45:07,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1275442234, now seen corresponding path program 1 times [2023-02-16 01:45:07,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:45:07,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882198110] [2023-02-16 01:45:07,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:45:07,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:45:07,487 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 01:45:07,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1304143736] [2023-02-16 01:45:07,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:45:07,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:45:07,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:45:07,490 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 01:45:07,491 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 01:45:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:45:07,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-16 01:45:07,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:45:07,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:45:07,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:45:07,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:45:07,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:45:07,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882198110] [2023-02-16 01:45:07,786 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 01:45:07,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304143736] [2023-02-16 01:45:07,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304143736] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:45:07,788 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:45:07,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-16 01:45:07,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984232969] [2023-02-16 01:45:07,792 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:45:07,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 01:45:07,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:45:07,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 01:45:07,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-16 01:45:07,796 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 01:45:08,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:45:08,043 INFO L93 Difference]: Finished difference Result 54 states and 76 transitions. [2023-02-16 01:45:08,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 01:45:08,048 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2023-02-16 01:45:08,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:45:08,050 INFO L225 Difference]: With dead ends: 54 [2023-02-16 01:45:08,050 INFO L226 Difference]: Without dead ends: 52 [2023-02-16 01:45:08,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-16 01:45:08,051 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 20 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 01:45:08,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 71 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 01:45:08,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-16 01:45:08,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2023-02-16 01:45:08,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-16 01:45:08,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 66 transitions. [2023-02-16 01:45:08,079 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 66 transitions. Word has length 13 [2023-02-16 01:45:08,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:45:08,079 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 66 transitions. [2023-02-16 01:45:08,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 01:45:08,080 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 66 transitions. [2023-02-16 01:45:08,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-16 01:45:08,082 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:45:08,082 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:45:08,087 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 01:45:08,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:45:08,286 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:45:08,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:45:08,287 INFO L85 PathProgramCache]: Analyzing trace with hash 427545983, now seen corresponding path program 1 times [2023-02-16 01:45:08,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:45:08,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151763230] [2023-02-16 01:45:08,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:45:08,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:45:08,299 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 01:45:08,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1398659657] [2023-02-16 01:45:08,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:45:08,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:45:08,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:45:08,335 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 01:45:08,339 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 01:45:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:45:08,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-16 01:45:08,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:45:08,437 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 01:45:08,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:45:08,544 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 01:45:08,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:45:08,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151763230] [2023-02-16 01:45:08,548 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 01:45:08,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398659657] [2023-02-16 01:45:08,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398659657] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:45:08,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:45:08,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-16 01:45:08,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442967519] [2023-02-16 01:45:08,551 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:45:08,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 01:45:08,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:45:08,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 01:45:08,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-16 01:45:08,558 INFO L87 Difference]: Start difference. First operand 47 states and 66 transitions. Second operand has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 01:45:08,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:45:08,800 INFO L93 Difference]: Finished difference Result 60 states and 83 transitions. [2023-02-16 01:45:08,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 01:45:08,801 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 18 [2023-02-16 01:45:08,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:45:08,802 INFO L225 Difference]: With dead ends: 60 [2023-02-16 01:45:08,802 INFO L226 Difference]: Without dead ends: 58 [2023-02-16 01:45:08,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-16 01:45:08,804 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 21 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 01:45:08,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 61 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 01:45:08,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-02-16 01:45:08,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2023-02-16 01:45:08,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 26 states have internal predecessors, (28), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-02-16 01:45:08,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2023-02-16 01:45:08,815 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 18 [2023-02-16 01:45:08,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:45:08,815 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2023-02-16 01:45:08,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 01:45:08,815 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2023-02-16 01:45:08,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-16 01:45:08,816 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:45:08,816 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:45:08,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-16 01:45:09,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:45:09,022 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:45:09,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:45:09,023 INFO L85 PathProgramCache]: Analyzing trace with hash 5607206, now seen corresponding path program 1 times [2023-02-16 01:45:09,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:45:09,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230062154] [2023-02-16 01:45:09,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:45:09,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:45:09,031 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 01:45:09,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [324602468] [2023-02-16 01:45:09,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:45:09,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:45:09,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:45:09,033 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 01:45:09,035 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 01:45:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:45:09,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-16 01:45:09,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:45:09,120 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-16 01:45:09,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:45:09,357 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-16 01:45:09,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:45:09,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230062154] [2023-02-16 01:45:09,358 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 01:45:09,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324602468] [2023-02-16 01:45:09,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324602468] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:45:09,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:45:09,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-16 01:45:09,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572429120] [2023-02-16 01:45:09,358 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:45:09,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 01:45:09,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:45:09,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 01:45:09,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-16 01:45:09,359 INFO L87 Difference]: Start difference. First operand 51 states and 69 transitions. Second operand has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 01:45:10,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:45:10,775 INFO L93 Difference]: Finished difference Result 74 states and 100 transitions. [2023-02-16 01:45:10,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 01:45:10,775 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) Word has length 23 [2023-02-16 01:45:10,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:45:10,776 INFO L225 Difference]: With dead ends: 74 [2023-02-16 01:45:10,776 INFO L226 Difference]: Without dead ends: 65 [2023-02-16 01:45:10,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-16 01:45:10,777 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 23 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-16 01:45:10,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 60 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-02-16 01:45:10,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-02-16 01:45:10,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-02-16 01:45:10,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2023-02-16 01:45:10,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2023-02-16 01:45:10,790 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 23 [2023-02-16 01:45:10,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:45:10,790 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2023-02-16 01:45:10,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 01:45:10,791 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2023-02-16 01:45:10,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-16 01:45:10,792 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:45:10,792 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:45:10,807 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 01:45:10,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:45:10,996 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:45:10,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:45:10,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1172224904, now seen corresponding path program 1 times [2023-02-16 01:45:10,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:45:10,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963024758] [2023-02-16 01:45:10,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:45:10,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:45:11,004 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 01:45:11,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [887220802] [2023-02-16 01:45:11,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:45:11,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:45:11,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:45:11,006 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 01:45:11,018 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 01:45:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:45:11,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 01:45:11,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:45:11,085 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-02-16 01:45:11,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:45:11,120 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-02-16 01:45:11,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:45:11,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963024758] [2023-02-16 01:45:11,121 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 01:45:11,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887220802] [2023-02-16 01:45:11,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887220802] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:45:11,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:45:11,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-02-16 01:45:11,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085414887] [2023-02-16 01:45:11,121 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:45:11,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 01:45:11,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:45:11,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 01:45:11,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-16 01:45:11,123 INFO L87 Difference]: Start difference. First operand 65 states and 84 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-02-16 01:45:11,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:45:11,222 INFO L93 Difference]: Finished difference Result 140 states and 177 transitions. [2023-02-16 01:45:11,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 01:45:11,222 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 41 [2023-02-16 01:45:11,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:45:11,223 INFO L225 Difference]: With dead ends: 140 [2023-02-16 01:45:11,224 INFO L226 Difference]: Without dead ends: 119 [2023-02-16 01:45:11,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 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 01:45:11,225 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 53 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 01:45:11,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 165 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 01:45:11,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-02-16 01:45:11,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2023-02-16 01:45:11,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 59 states have (on average 1.11864406779661) internal successors, (66), 63 states have internal predecessors, (66), 41 states have call successors, (41), 14 states have call predecessors, (41), 14 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2023-02-16 01:45:11,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 144 transitions. [2023-02-16 01:45:11,252 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 144 transitions. Word has length 41 [2023-02-16 01:45:11,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:45:11,253 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 144 transitions. [2023-02-16 01:45:11,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-02-16 01:45:11,253 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 144 transitions. [2023-02-16 01:45:11,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-16 01:45:11,254 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:45:11,254 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:45:11,261 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 01:45:11,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:45:11,459 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:45:11,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:45:11,459 INFO L85 PathProgramCache]: Analyzing trace with hash -399462631, now seen corresponding path program 1 times [2023-02-16 01:45:11,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:45:11,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258245732] [2023-02-16 01:45:11,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:45:11,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:45:11,466 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 01:45:11,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1515173406] [2023-02-16 01:45:11,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:45:11,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:45:11,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:45:11,468 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 01:45:11,485 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 01:45:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:45:11,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-16 01:45:11,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:45:11,606 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 13 proven. 24 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-16 01:45:11,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:45:11,713 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 13 proven. 24 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-16 01:45:11,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:45:11,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258245732] [2023-02-16 01:45:11,713 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 01:45:11,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515173406] [2023-02-16 01:45:11,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515173406] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:45:11,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:45:11,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-02-16 01:45:11,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945528803] [2023-02-16 01:45:11,714 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:45:11,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 01:45:11,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:45:11,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 01:45:11,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-02-16 01:45:11,715 INFO L87 Difference]: Start difference. First operand 115 states and 144 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2023-02-16 01:45:14,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-16 01:45:14,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:45:14,592 INFO L93 Difference]: Finished difference Result 129 states and 157 transitions. [2023-02-16 01:45:14,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 01:45:14,593 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) Word has length 46 [2023-02-16 01:45:14,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:45:14,594 INFO L225 Difference]: With dead ends: 129 [2023-02-16 01:45:14,594 INFO L226 Difference]: Without dead ends: 127 [2023-02-16 01:45:14,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-02-16 01:45:14,595 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 21 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 56 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-02-16 01:45:14,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 98 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 480 Invalid, 1 Unknown, 0 Unchecked, 2.8s Time] [2023-02-16 01:45:14,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-02-16 01:45:14,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2023-02-16 01:45:14,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 72 states have internal predecessors, (75), 41 states have call successors, (41), 17 states have call predecessors, (41), 17 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2023-02-16 01:45:14,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 153 transitions. [2023-02-16 01:45:14,621 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 153 transitions. Word has length 46 [2023-02-16 01:45:14,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:45:14,622 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 153 transitions. [2023-02-16 01:45:14,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2023-02-16 01:45:14,622 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 153 transitions. [2023-02-16 01:45:14,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-16 01:45:14,626 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:45:14,626 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-16 01:45:14,633 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 01:45:14,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:45:14,831 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:45:14,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:45:14,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1316290887, now seen corresponding path program 2 times [2023-02-16 01:45:14,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:45:14,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027463359] [2023-02-16 01:45:14,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:45:14,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:45:14,848 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 01:45:14,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [811914719] [2023-02-16 01:45:14,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 01:45:14,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:45:14,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:45:14,872 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 01:45:14,904 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 01:45:14,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 01:45:14,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 01:45:14,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-16 01:45:14,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:45:15,009 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 17 proven. 32 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-02-16 01:45:15,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:45:15,179 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 20 proven. 25 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-02-16 01:45:15,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:45:15,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027463359] [2023-02-16 01:45:15,180 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 01:45:15,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811914719] [2023-02-16 01:45:15,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811914719] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:45:15,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:45:15,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-16 01:45:15,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059501151] [2023-02-16 01:45:15,180 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:45:15,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 01:45:15,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:45:15,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 01:45:15,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-02-16 01:45:15,182 INFO L87 Difference]: Start difference. First operand 127 states and 153 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2023-02-16 01:45:15,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:45:15,876 INFO L93 Difference]: Finished difference Result 141 states and 166 transitions. [2023-02-16 01:45:15,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 01:45:15,877 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 56 [2023-02-16 01:45:15,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:45:15,878 INFO L225 Difference]: With dead ends: 141 [2023-02-16 01:45:15,878 INFO L226 Difference]: Without dead ends: 135 [2023-02-16 01:45:15,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-02-16 01:45:15,878 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-16 01:45:15,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 94 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-16 01:45:15,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-02-16 01:45:15,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2023-02-16 01:45:15,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 77 states have (on average 1.0909090909090908) internal successors, (84), 81 states have internal predecessors, (84), 37 states have call successors, (37), 20 states have call predecessors, (37), 20 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-02-16 01:45:15,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 154 transitions. [2023-02-16 01:45:15,907 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 154 transitions. Word has length 56 [2023-02-16 01:45:15,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:45:15,907 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 154 transitions. [2023-02-16 01:45:15,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2023-02-16 01:45:15,907 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 154 transitions. [2023-02-16 01:45:15,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-02-16 01:45:15,910 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:45:15,910 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:45:15,925 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 01:45:16,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:45:16,116 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:45:16,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:45:16,116 INFO L85 PathProgramCache]: Analyzing trace with hash 616227619, now seen corresponding path program 1 times [2023-02-16 01:45:16,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:45:16,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319104623] [2023-02-16 01:45:16,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:45:16,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:45:16,139 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 01:45:16,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1620188488] [2023-02-16 01:45:16,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:45:16,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:45:16,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:45:16,141 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 01:45:16,143 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 01:45:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:45:16,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-16 01:45:16,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:45:16,534 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 21 proven. 39 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-16 01:45:16,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:45:16,760 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-16 01:45:16,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:45:16,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319104623] [2023-02-16 01:45:16,761 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 01:45:16,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620188488] [2023-02-16 01:45:16,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620188488] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:45:16,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:45:16,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-02-16 01:45:16,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270980303] [2023-02-16 01:45:16,761 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:45:16,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 01:45:16,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:45:16,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 01:45:16,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-02-16 01:45:16,763 INFO L87 Difference]: Start difference. First operand 135 states and 154 transitions. Second operand has 14 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2023-02-16 01:45:17,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:45:17,258 INFO L93 Difference]: Finished difference Result 149 states and 167 transitions. [2023-02-16 01:45:17,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 01:45:17,258 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) Word has length 67 [2023-02-16 01:45:17,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:45:17,259 INFO L225 Difference]: With dead ends: 149 [2023-02-16 01:45:17,259 INFO L226 Difference]: Without dead ends: 145 [2023-02-16 01:45:17,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2023-02-16 01:45:17,260 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 20 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 01:45:17,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 84 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 01:45:17,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-16 01:45:17,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2023-02-16 01:45:17,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 85 states have (on average 1.0705882352941176) internal successors, (91), 88 states have internal predecessors, (91), 37 states have call successors, (37), 23 states have call predecessors, (37), 22 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-02-16 01:45:17,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 161 transitions. [2023-02-16 01:45:17,284 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 161 transitions. Word has length 67 [2023-02-16 01:45:17,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:45:17,285 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 161 transitions. [2023-02-16 01:45:17,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2023-02-16 01:45:17,285 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 161 transitions. [2023-02-16 01:45:17,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-16 01:45:17,286 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:45:17,286 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:45:17,292 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 01:45:17,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:45:17,491 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:45:17,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:45:17,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1808123650, now seen corresponding path program 1 times [2023-02-16 01:45:17,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:45:17,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713888455] [2023-02-16 01:45:17,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:45:17,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:45:17,497 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 01:45:17,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1092888491] [2023-02-16 01:45:17,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:45:17,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:45:17,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:45:17,514 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 01:45:17,532 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 01:45:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:45:17,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-16 01:45:17,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:45:17,855 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 23 proven. 42 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-02-16 01:45:17,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:45:18,091 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 23 proven. 42 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-02-16 01:45:18,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:45:18,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713888455] [2023-02-16 01:45:18,092 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 01:45:18,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092888491] [2023-02-16 01:45:18,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092888491] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:45:18,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:45:18,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2023-02-16 01:45:18,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146493269] [2023-02-16 01:45:18,092 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:45:18,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-16 01:45:18,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:45:18,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-16 01:45:18,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2023-02-16 01:45:18,093 INFO L87 Difference]: Start difference. First operand 145 states and 161 transitions. Second operand has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 7 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 6 states have call predecessors, (24), 7 states have call successors, (24) [2023-02-16 01:45:19,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:45:19,083 INFO L93 Difference]: Finished difference Result 164 states and 188 transitions. [2023-02-16 01:45:19,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-16 01:45:19,084 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 7 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 6 states have call predecessors, (24), 7 states have call successors, (24) Word has length 72 [2023-02-16 01:45:19,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:45:19,085 INFO L225 Difference]: With dead ends: 164 [2023-02-16 01:45:19,085 INFO L226 Difference]: Without dead ends: 153 [2023-02-16 01:45:19,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2023-02-16 01:45:19,085 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 18 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-16 01:45:19,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 101 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-16 01:45:19,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-02-16 01:45:19,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2023-02-16 01:45:19,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 87 states have (on average 1.0689655172413792) internal successors, (93), 91 states have internal predecessors, (93), 42 states have call successors, (42), 23 states have call predecessors, (42), 23 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2023-02-16 01:45:19,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 174 transitions. [2023-02-16 01:45:19,114 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 174 transitions. Word has length 72 [2023-02-16 01:45:19,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:45:19,114 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 174 transitions. [2023-02-16 01:45:19,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 7 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 6 states have call predecessors, (24), 7 states have call successors, (24) [2023-02-16 01:45:19,114 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 174 transitions. [2023-02-16 01:45:19,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-02-16 01:45:19,115 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:45:19,115 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2023-02-16 01:45:19,121 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 01:45:19,320 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,SelfDestructingSolverStorable10 [2023-02-16 01:45:19,321 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:45:19,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:45:19,321 INFO L85 PathProgramCache]: Analyzing trace with hash 514910066, now seen corresponding path program 3 times [2023-02-16 01:45:19,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:45:19,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996317636] [2023-02-16 01:45:19,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:45:19,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:45:19,327 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 01:45:19,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1579447274] [2023-02-16 01:45:19,328 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 01:45:19,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:45:19,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:45:19,332 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 01:45:19,332 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 01:45:19,379 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-16 01:45:19,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 01:45:19,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-16 01:45:19,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:45:19,538 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 55 proven. 27 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-02-16 01:45:19,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:45:20,329 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 55 proven. 27 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-02-16 01:45:20,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:45:20,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996317636] [2023-02-16 01:45:20,329 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 01:45:20,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579447274] [2023-02-16 01:45:20,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579447274] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:45:20,329 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:45:20,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2023-02-16 01:45:20,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362267625] [2023-02-16 01:45:20,329 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:45:20,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-16 01:45:20,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:45:20,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-16 01:45:20,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2023-02-16 01:45:20,330 INFO L87 Difference]: Start difference. First operand 153 states and 174 transitions. Second operand has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) [2023-02-16 01:45:23,520 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 01:45:25,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:45:25,538 INFO L93 Difference]: Finished difference Result 159 states and 179 transitions. [2023-02-16 01:45:25,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 01:45:25,539 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) Word has length 79 [2023-02-16 01:45:25,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:45:25,540 INFO L225 Difference]: With dead ends: 159 [2023-02-16 01:45:25,540 INFO L226 Difference]: Without dead ends: 143 [2023-02-16 01:45:25,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 141 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2023-02-16 01:45:25,541 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 25 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 78 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-02-16 01:45:25,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 96 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 423 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2023-02-16 01:45:25,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-02-16 01:45:25,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2023-02-16 01:45:25,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 84 states have (on average 1.0476190476190477) internal successors, (88), 87 states have internal predecessors, (88), 34 states have call successors, (34), 22 states have call predecessors, (34), 22 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2023-02-16 01:45:25,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 155 transitions. [2023-02-16 01:45:25,579 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 155 transitions. Word has length 79 [2023-02-16 01:45:25,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:45:25,580 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 155 transitions. [2023-02-16 01:45:25,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) [2023-02-16 01:45:25,580 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 155 transitions. [2023-02-16 01:45:25,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-02-16 01:45:25,581 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:45:25,581 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:45:25,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-16 01:45:25,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:45:25,787 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:45:25,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:45:25,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1602424598, now seen corresponding path program 2 times [2023-02-16 01:45:25,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:45:25,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895562695] [2023-02-16 01:45:25,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:45:25,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:45:25,794 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 01:45:25,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2137031010] [2023-02-16 01:45:25,794 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 01:45:25,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:45:25,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:45:25,795 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 01:45:25,815 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 01:45:25,851 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 01:45:25,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 01:45:25,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-16 01:45:25,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:45:25,986 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 120 proven. 656 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2023-02-16 01:45:25,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:45:26,111 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-02-16 01:45:26,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:45:26,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895562695] [2023-02-16 01:45:26,112 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 01:45:26,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137031010] [2023-02-16 01:45:26,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137031010] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:45:26,112 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:45:26,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-02-16 01:45:26,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422719066] [2023-02-16 01:45:26,113 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:45:26,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 01:45:26,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:45:26,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 01:45:26,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-02-16 01:45:26,114 INFO L87 Difference]: Start difference. First operand 141 states and 155 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 9 states have call successors, (43), 6 states have call predecessors, (43), 6 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) [2023-02-16 01:45:26,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:45:26,452 INFO L93 Difference]: Finished difference Result 398 states and 422 transitions. [2023-02-16 01:45:26,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-16 01:45:26,453 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 9 states have call successors, (43), 6 states have call predecessors, (43), 6 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) Word has length 125 [2023-02-16 01:45:26,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:45:26,454 INFO L225 Difference]: With dead ends: 398 [2023-02-16 01:45:26,454 INFO L226 Difference]: Without dead ends: 382 [2023-02-16 01:45:26,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 236 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 01:45:26,455 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 143 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 01:45:26,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 357 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 01:45:26,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2023-02-16 01:45:26,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 326. [2023-02-16 01:45:26,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 202 states have (on average 1.0495049504950495) internal successors, (212), 209 states have internal predecessors, (212), 68 states have call successors, (68), 56 states have call predecessors, (68), 55 states have return successors, (65), 60 states have call predecessors, (65), 65 states have call successors, (65) [2023-02-16 01:45:26,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 345 transitions. [2023-02-16 01:45:26,510 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 345 transitions. Word has length 125 [2023-02-16 01:45:26,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:45:26,510 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 345 transitions. [2023-02-16 01:45:26,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 9 states have call successors, (43), 6 states have call predecessors, (43), 6 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) [2023-02-16 01:45:26,510 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 345 transitions. [2023-02-16 01:45:26,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-02-16 01:45:26,511 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:45:26,511 INFO L195 NwaCegarLoop]: trace histogram [24, 23, 23, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:45:26,519 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 01:45:26,717 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,SelfDestructingSolverStorable12 [2023-02-16 01:45:26,717 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:45:26,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:45:26,717 INFO L85 PathProgramCache]: Analyzing trace with hash 36255119, now seen corresponding path program 1 times [2023-02-16 01:45:26,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:45:26,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146065020] [2023-02-16 01:45:26,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:45:26,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:45:26,724 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 01:45:26,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1833987714] [2023-02-16 01:45:26,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:45:26,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:45:26,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:45:26,725 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 01:45:26,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-16 01:45:26,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:45:26,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 49 conjunts are in the unsatisfiable core [2023-02-16 01:45:26,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:45:27,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1106 backedges. 104 proven. 116 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2023-02-16 01:45:27,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:45:30,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:45:30,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146065020] [2023-02-16 01:45:30,087 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 01:45:30,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833987714] [2023-02-16 01:45:30,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833987714] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:45:30,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-16 01:45:30,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2023-02-16 01:45:30,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121079274] [2023-02-16 01:45:30,088 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-16 01:45:30,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 01:45:30,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:45:30,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 01:45:30,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=238, Unknown=1, NotChecked=0, Total=306 [2023-02-16 01:45:30,089 INFO L87 Difference]: Start difference. First operand 326 states and 345 transitions. Second operand has 12 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 6 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2023-02-16 01:45:30,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:45:30,518 INFO L93 Difference]: Finished difference Result 328 states and 346 transitions. [2023-02-16 01:45:30,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 01:45:30,519 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 6 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) Word has length 133 [2023-02-16 01:45:30,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:45:30,520 INFO L225 Difference]: With dead ends: 328 [2023-02-16 01:45:30,520 INFO L226 Difference]: Without dead ends: 312 [2023-02-16 01:45:30,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=91, Invalid=328, Unknown=1, NotChecked=0, Total=420 [2023-02-16 01:45:30,521 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 12 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 01:45:30,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 149 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 01:45:30,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2023-02-16 01:45:30,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2023-02-16 01:45:30,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 194 states have (on average 1.0463917525773196) internal successors, (203), 201 states have internal predecessors, (203), 64 states have call successors, (64), 53 states have call predecessors, (64), 53 states have return successors, (62), 57 states have call predecessors, (62), 62 states have call successors, (62) [2023-02-16 01:45:30,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 329 transitions. [2023-02-16 01:45:30,584 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 329 transitions. Word has length 133 [2023-02-16 01:45:30,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:45:30,584 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 329 transitions. [2023-02-16 01:45:30,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 6 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2023-02-16 01:45:30,584 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 329 transitions. [2023-02-16 01:45:30,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-02-16 01:45:30,585 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:45:30,585 INFO L195 NwaCegarLoop]: trace histogram [28, 27, 27, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:45:30,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-16 01:45:30,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-02-16 01:45:30,790 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:45:30,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:45:30,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1972302768, now seen corresponding path program 2 times [2023-02-16 01:45:30,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:45:30,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41591940] [2023-02-16 01:45:30,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:45:30,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:45:30,797 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 01:45:30,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [682348709] [2023-02-16 01:45:30,798 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 01:45:30,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:45:30,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:45:30,799 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 01:45:30,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-16 01:45:30,862 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 01:45:30,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 01:45:30,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 47 conjunts are in the unsatisfiable core [2023-02-16 01:45:30,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:45:31,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 128 proven. 84 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2023-02-16 01:45:31,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:45:32,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:45:32,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41591940] [2023-02-16 01:45:32,070 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 01:45:32,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682348709] [2023-02-16 01:45:32,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682348709] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:45:32,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-16 01:45:32,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2023-02-16 01:45:32,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205229065] [2023-02-16 01:45:32,070 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-16 01:45:32,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-16 01:45:32,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:45:32,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-16 01:45:32,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2023-02-16 01:45:32,071 INFO L87 Difference]: Start difference. First operand 312 states and 329 transitions. Second operand has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 7 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 6 states have call predecessors, (27), 7 states have call successors, (27) [2023-02-16 01:45:32,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:45:32,543 INFO L93 Difference]: Finished difference Result 325 states and 342 transitions. [2023-02-16 01:45:32,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 01:45:32,543 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 7 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 6 states have call predecessors, (27), 7 states have call successors, (27) Word has length 156 [2023-02-16 01:45:32,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:45:32,544 INFO L225 Difference]: With dead ends: 325 [2023-02-16 01:45:32,545 INFO L226 Difference]: Without dead ends: 323 [2023-02-16 01:45:32,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2023-02-16 01:45:32,545 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 11 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 01:45:32,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 175 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 01:45:32,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2023-02-16 01:45:32,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 322. [2023-02-16 01:45:32,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 200 states have (on average 1.045) internal successors, (209), 207 states have internal predecessors, (209), 66 states have call successors, (66), 55 states have call predecessors, (66), 55 states have return successors, (64), 59 states have call predecessors, (64), 64 states have call successors, (64) [2023-02-16 01:45:32,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 339 transitions. [2023-02-16 01:45:32,609 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 339 transitions. Word has length 156 [2023-02-16 01:45:32,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:45:32,609 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 339 transitions. [2023-02-16 01:45:32,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 7 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (27), 6 states have call predecessors, (27), 7 states have call successors, (27) [2023-02-16 01:45:32,609 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 339 transitions. [2023-02-16 01:45:32,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-02-16 01:45:32,610 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:45:32,611 INFO L195 NwaCegarLoop]: trace histogram [29, 28, 28, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:45:32,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-16 01:45:32,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-16 01:45:32,816 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:45:32,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:45:32,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1802004917, now seen corresponding path program 2 times [2023-02-16 01:45:32,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:45:32,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725184258] [2023-02-16 01:45:32,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:45:32,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:45:32,835 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 01:45:32,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [84031922] [2023-02-16 01:45:32,836 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 01:45:32,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:45:32,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:45:32,855 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 01:45:32,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-16 01:45:32,920 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 01:45:32,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 01:45:32,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 63 conjunts are in the unsatisfiable core [2023-02-16 01:45:32,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:45:34,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 204 proven. 88 refuted. 0 times theorem prover too weak. 1356 trivial. 0 not checked. [2023-02-16 01:45:34,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:45:46,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 204 proven. 88 refuted. 0 times theorem prover too weak. 1356 trivial. 0 not checked. [2023-02-16 01:45:46,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:45:46,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725184258] [2023-02-16 01:45:46,355 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 01:45:46,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84031922] [2023-02-16 01:45:46,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84031922] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:45:46,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:45:46,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2023-02-16 01:45:46,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614976875] [2023-02-16 01:45:46,355 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:45:46,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-16 01:45:46,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:45:46,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-16 01:45:46,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=359, Unknown=4, NotChecked=0, Total=462 [2023-02-16 01:45:46,357 INFO L87 Difference]: Start difference. First operand 322 states and 339 transitions. Second operand has 22 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 17 states have internal predecessors, (46), 14 states have call successors, (58), 3 states have call predecessors, (58), 2 states have return successors, (56), 14 states have call predecessors, (56), 14 states have call successors, (56) [2023-02-16 01:46:28,878 WARN L233 SmtUtils]: Spent 41.50s on a formula simplification that was a NOOP. DAG size: 161 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 01:46:30,935 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 01:46:33,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-16 01:46:35,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-16 01:46:38,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-16 01:46:42,620 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 01:46:44,624 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 01:46:53,192 WARN L233 SmtUtils]: Spent 5.21s on a formula simplification that was a NOOP. DAG size: 130 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 01:46:55,207 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 01:46:57,717 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 01:47:01,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-16 01:47:02,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-16 01:47:04,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-16 01:47:05,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-02-16 01:47:32,001 WARN L233 SmtUtils]: Spent 24.71s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 01:47:39,251 WARN L233 SmtUtils]: Spent 7.10s on a formula simplification that was a NOOP. DAG size: 97 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 01:47:46,565 WARN L233 SmtUtils]: Spent 7.19s on a formula simplification that was a NOOP. DAG size: 95 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 01:47:50,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-16 01:47:52,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-16 01:47:57,000 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 01:47:59,605 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 01:48:01,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-16 01:48:14,578 WARN L233 SmtUtils]: Spent 11.07s on a formula simplification that was a NOOP. DAG size: 154 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 01:48:15,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-16 01:48:15,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:48:15,950 INFO L93 Difference]: Finished difference Result 346 states and 373 transitions. [2023-02-16 01:48:15,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-16 01:48:15,950 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 17 states have internal predecessors, (46), 14 states have call successors, (58), 3 states have call predecessors, (58), 2 states have return successors, (56), 14 states have call predecessors, (56), 14 states have call successors, (56) Word has length 161 [2023-02-16 01:48:15,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:48:15,952 INFO L225 Difference]: With dead ends: 346 [2023-02-16 01:48:15,952 INFO L226 Difference]: Without dead ends: 320 [2023-02-16 01:48:15,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 298 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 111.0s TimeCoverageRelationStatistics Valid=281, Invalid=837, Unknown=4, NotChecked=0, Total=1122 [2023-02-16 01:48:15,952 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 34 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 131 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.5s IncrementalHoareTripleChecker+Time [2023-02-16 01:48:15,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 197 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1110 Invalid, 13 Unknown, 0 Unchecked, 44.5s Time] [2023-02-16 01:48:15,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2023-02-16 01:48:16,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 317. [2023-02-16 01:48:16,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 194 states have (on average 1.041237113402062) internal successors, (202), 200 states have internal predecessors, (202), 70 states have call successors, (70), 53 states have call predecessors, (70), 52 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) [2023-02-16 01:48:16,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 339 transitions. [2023-02-16 01:48:16,062 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 339 transitions. Word has length 161 [2023-02-16 01:48:16,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:48:16,062 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 339 transitions. [2023-02-16 01:48:16,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 17 states have internal predecessors, (46), 14 states have call successors, (58), 3 states have call predecessors, (58), 2 states have return successors, (56), 14 states have call predecessors, (56), 14 states have call successors, (56) [2023-02-16 01:48:16,063 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 339 transitions. [2023-02-16 01:48:16,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2023-02-16 01:48:16,064 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:48:16,064 INFO L195 NwaCegarLoop]: trace histogram [33, 32, 32, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:48:16,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-16 01:48:16,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-16 01:48:16,269 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:48:16,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:48:16,269 INFO L85 PathProgramCache]: Analyzing trace with hash -476934806, now seen corresponding path program 3 times [2023-02-16 01:48:16,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:48:16,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966016399] [2023-02-16 01:48:16,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:48:16,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:48:16,278 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 01:48:16,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [119301010] [2023-02-16 01:48:16,278 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 01:48:16,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:48:16,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:48:16,279 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 01:48:16,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-16 01:48:17,322 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-16 01:48:17,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 01:48:17,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 51 conjunts are in the unsatisfiable core [2023-02-16 01:48:17,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:48:38,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2168 backedges. 485 proven. 59 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2023-02-16 01:48:38,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:48:41,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2168 backedges. 350 proven. 19 refuted. 0 times theorem prover too weak. 1799 trivial. 0 not checked. [2023-02-16 01:48:41,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:48:41,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966016399] [2023-02-16 01:48:41,434 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 01:48:41,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119301010] [2023-02-16 01:48:41,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119301010] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:48:41,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:48:41,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 20 [2023-02-16 01:48:41,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031936060] [2023-02-16 01:48:41,434 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:48:41,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-16 01:48:41,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:48:41,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-16 01:48:41,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2023-02-16 01:48:41,435 INFO L87 Difference]: Start difference. First operand 317 states and 339 transitions. Second operand has 20 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 12 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (31), 11 states have call predecessors, (31), 10 states have call successors, (31) [2023-02-16 01:48:46,794 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 01:48:48,997 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 01:48:51,085 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 01:48:53,886 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 01:48:55,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-16 01:48:56,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-16 01:49:00,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-16 01:49:02,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-16 01:49:04,500 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 01:49:06,501 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 01:49:08,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-16 01:49:10,702 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 01:49:14,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:49:14,103 INFO L93 Difference]: Finished difference Result 329 states and 350 transitions. [2023-02-16 01:49:14,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-16 01:49:14,104 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 12 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (31), 11 states have call predecessors, (31), 10 states have call successors, (31) Word has length 184 [2023-02-16 01:49:14,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:49:14,105 INFO L225 Difference]: With dead ends: 329 [2023-02-16 01:49:14,105 INFO L226 Difference]: Without dead ends: 296 [2023-02-16 01:49:14,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 345 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 23.1s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2023-02-16 01:49:14,106 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 20 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 44 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.1s IncrementalHoareTripleChecker+Time [2023-02-16 01:49:14,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 80 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 231 Invalid, 7 Unknown, 0 Unchecked, 25.1s Time] [2023-02-16 01:49:14,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2023-02-16 01:49:14,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 290. [2023-02-16 01:49:14,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 187 states have (on average 1.0053475935828877) internal successors, (188), 187 states have internal predecessors, (188), 52 states have call successors, (52), 51 states have call predecessors, (52), 50 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2023-02-16 01:49:14,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 291 transitions. [2023-02-16 01:49:14,196 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 291 transitions. Word has length 184 [2023-02-16 01:49:14,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:49:14,196 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 291 transitions. [2023-02-16 01:49:14,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 12 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (31), 11 states have call predecessors, (31), 10 states have call successors, (31) [2023-02-16 01:49:14,196 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 291 transitions. [2023-02-16 01:49:14,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2023-02-16 01:49:14,198 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:49:14,198 INFO L195 NwaCegarLoop]: trace histogram [52, 51, 51, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:49:14,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-16 01:49:14,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:49:14,405 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:49:14,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:49:14,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1951591730, now seen corresponding path program 3 times [2023-02-16 01:49:14,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:49:14,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138479456] [2023-02-16 01:49:14,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:49:14,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:49:14,414 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 01:49:14,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [322546503] [2023-02-16 01:49:14,415 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 01:49:14,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:49:14,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:49:14,416 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 01:49:14,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-16 01:49:14,598 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2023-02-16 01:49:14,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 01:49:14,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-16 01:49:14,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:49:14,918 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 300 proven. 4880 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2023-02-16 01:49:14,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:49:15,238 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 102 proven. 380 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2023-02-16 01:49:15,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:49:15,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138479456] [2023-02-16 01:49:15,238 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 01:49:15,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322546503] [2023-02-16 01:49:15,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322546503] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:49:15,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:49:15,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2023-02-16 01:49:15,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643560920] [2023-02-16 01:49:15,239 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:49:15,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-16 01:49:15,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:49:15,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-16 01:49:15,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2023-02-16 01:49:15,240 INFO L87 Difference]: Start difference. First operand 290 states and 291 transitions. Second operand has 24 states, 24 states have (on average 4.291666666666667) internal successors, (103), 24 states have internal predecessors, (103), 20 states have call successors, (103), 12 states have call predecessors, (103), 12 states have return successors, (102), 20 states have call predecessors, (102), 20 states have call successors, (102) [2023-02-16 01:49:15,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:49:15,937 INFO L93 Difference]: Finished difference Result 580 states and 590 transitions. [2023-02-16 01:49:15,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-02-16 01:49:15,938 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.291666666666667) internal successors, (103), 24 states have internal predecessors, (103), 20 states have call successors, (103), 12 states have call predecessors, (103), 12 states have return successors, (102), 20 states have call predecessors, (102), 20 states have call successors, (102) Word has length 293 [2023-02-16 01:49:15,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:49:15,940 INFO L225 Difference]: With dead ends: 580 [2023-02-16 01:49:15,940 INFO L226 Difference]: Without dead ends: 570 [2023-02-16 01:49:15,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 560 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2023-02-16 01:49:15,941 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 99 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 01:49:15,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 509 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 01:49:15,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2023-02-16 01:49:16,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2023-02-16 01:49:16,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 367 states have (on average 1.002724795640327) internal successors, (368), 367 states have internal predecessors, (368), 102 states have call successors, (102), 101 states have call predecessors, (102), 100 states have return successors, (101), 101 states have call predecessors, (101), 101 states have call successors, (101) [2023-02-16 01:49:16,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 571 transitions. [2023-02-16 01:49:16,084 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 571 transitions. Word has length 293 [2023-02-16 01:49:16,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:49:16,084 INFO L495 AbstractCegarLoop]: Abstraction has 570 states and 571 transitions. [2023-02-16 01:49:16,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.291666666666667) internal successors, (103), 24 states have internal predecessors, (103), 20 states have call successors, (103), 12 states have call predecessors, (103), 12 states have return successors, (102), 20 states have call predecessors, (102), 20 states have call successors, (102) [2023-02-16 01:49:16,084 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 571 transitions. [2023-02-16 01:49:16,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2023-02-16 01:49:16,090 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:49:16,090 INFO L195 NwaCegarLoop]: trace histogram [102, 101, 101, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:49:16,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-02-16 01:49:16,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-16 01:49:16,296 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:49:16,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:49:16,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1295956810, now seen corresponding path program 4 times [2023-02-16 01:49:16,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:49:16,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980043245] [2023-02-16 01:49:16,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:49:16,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:49:16,311 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 01:49:16,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [339427891] [2023-02-16 01:49:16,311 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-16 01:49:16,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:49:16,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:49:16,312 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 01:49:16,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-16 01:49:16,534 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-16 01:49:16,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-16 01:49:16,534 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 01:49:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 01:49:16,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 01:49:16,833 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-16 01:49:16,834 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-16 01:49:16,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-02-16 01:49:17,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:49:17,046 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:49:17,062 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-16 01:49:17,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.02 01:49:17 BoogieIcfgContainer [2023-02-16 01:49:17,172 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-16 01:49:17,173 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-16 01:49:17,173 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-16 01:49:17,173 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-16 01:49:17,173 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 01:45:06" (3/4) ... [2023-02-16 01:49:17,174 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-16 01:49:17,252 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-16 01:49:17,252 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-16 01:49:17,253 INFO L158 Benchmark]: Toolchain (without parser) took 250857.53ms. Allocated memory was 148.9MB in the beginning and 197.1MB in the end (delta: 48.2MB). Free memory was 108.1MB in the beginning and 125.3MB in the end (delta: -17.2MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. [2023-02-16 01:49:17,253 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 148.9MB. Free memory is still 96.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 01:49:17,253 INFO L158 Benchmark]: CACSL2BoogieTranslator took 160.12ms. Allocated memory is still 148.9MB. Free memory was 108.0MB in the beginning and 97.0MB in the end (delta: 11.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-16 01:49:17,253 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.06ms. Allocated memory is still 148.9MB. Free memory was 97.0MB in the beginning and 95.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 01:49:17,253 INFO L158 Benchmark]: Boogie Preprocessor took 16.32ms. Allocated memory is still 148.9MB. Free memory was 95.5MB in the beginning and 94.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 01:49:17,254 INFO L158 Benchmark]: RCFGBuilder took 261.06ms. Allocated memory is still 148.9MB. Free memory was 94.4MB in the beginning and 83.0MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-16 01:49:17,254 INFO L158 Benchmark]: TraceAbstraction took 250317.11ms. Allocated memory was 148.9MB in the beginning and 197.1MB in the end (delta: 48.2MB). Free memory was 82.4MB in the beginning and 142.1MB in the end (delta: -59.7MB). Peak memory consumption was 85.0MB. Max. memory is 16.1GB. [2023-02-16 01:49:17,254 INFO L158 Benchmark]: Witness Printer took 79.59ms. Allocated memory is still 197.1MB. Free memory was 142.1MB in the beginning and 125.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-16 01:49:17,255 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 148.9MB. Free memory is still 96.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 160.12ms. Allocated memory is still 148.9MB. Free memory was 108.0MB in the beginning and 97.0MB in the end (delta: 11.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.06ms. Allocated memory is still 148.9MB. Free memory was 97.0MB in the beginning and 95.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.32ms. Allocated memory is still 148.9MB. Free memory was 95.5MB in the beginning and 94.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 261.06ms. Allocated memory is still 148.9MB. Free memory was 94.4MB in the beginning and 83.0MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 250317.11ms. Allocated memory was 148.9MB in the beginning and 197.1MB in the end (delta: 48.2MB). Free memory was 82.4MB in the beginning and 142.1MB in the end (delta: -59.7MB). Peak memory consumption was 85.0MB. Max. memory is 16.1GB. * Witness Printer took 79.59ms. Allocated memory is still 197.1MB. Free memory was 142.1MB in the beginning and 125.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [counter=0] [L24] short a; [L25] long long n, x, y, z; [L26] a = __VERIFIER_nondet_ushort() [L28] n = 0 [L29] x = 0 [L30] y = 1 [L31] z = 6 VAL [a=20, counter=0, n=0, x=0, y=1, z=6] [L33] EXPR counter++ VAL [a=20, counter=1, counter++=0, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=1, n=0, x=0, y=1, z=6] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=1, n=0, x=0, y=1, z=6] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=1, n=0, x=0, y=1, z=6] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=1, n=0, x=0, y=1, z=6] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=1, n=0, x=0, y=1, z=6] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=1, n=1, x=1, y=7, z=12] [L33] EXPR counter++ VAL [a=20, counter=2, counter++=1, n=1, x=1, y=7, z=12] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=2, n=1, x=1, y=7, z=12] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=2, n=1, x=1, y=7, z=12] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=2, n=1, x=1, y=7, z=12] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=2, n=1, x=1, y=7, z=12] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=2, n=1, x=1, y=7, z=12] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=2, n=2, x=8, y=19, z=18] [L33] EXPR counter++ VAL [a=20, counter=3, counter++=2, n=2, x=8, y=19, z=18] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=3, n=2, x=8, y=19, z=18] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=3, n=2, x=8, y=19, z=18] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=3, n=2, x=8, y=19, z=18] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=3, n=2, x=8, y=19, z=18] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=3, n=2, x=8, y=19, z=18] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=3, n=3, x=27, y=37, z=24] [L33] EXPR counter++ VAL [a=20, counter=4, counter++=3, n=3, x=27, y=37, z=24] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=4, n=3, x=27, y=37, z=24] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=4, n=3, x=27, y=37, z=24] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=4, n=3, x=27, y=37, z=24] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=4, n=3, x=27, y=37, z=24] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=4, n=3, x=27, y=37, z=24] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=4, n=4, x=64, y=61, z=30] [L33] EXPR counter++ VAL [a=20, counter=5, counter++=4, n=4, x=64, y=61, z=30] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=5, n=4, x=64, y=61, z=30] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=5, n=4, x=64, y=61, z=30] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=5, n=4, x=64, y=61, z=30] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=5, n=4, x=64, y=61, z=30] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=5, n=4, x=64, y=61, z=30] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=5, n=5, x=125, y=91, z=36] [L33] EXPR counter++ VAL [a=20, counter=6, counter++=5, n=5, x=125, y=91, z=36] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=6, n=5, x=125, y=91, z=36] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=6, n=5, x=125, y=91, z=36] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=6, n=5, x=125, y=91, z=36] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=6, n=5, x=125, y=91, z=36] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=6, n=5, x=125, y=91, z=36] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=6, n=6, x=216, y=127, z=42] [L33] EXPR counter++ VAL [a=20, counter=7, counter++=6, n=6, x=216, y=127, z=42] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=7, n=6, x=216, y=127, z=42] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=7, n=6, x=216, y=127, z=42] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=7, n=6, x=216, y=127, z=42] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=7, n=6, x=216, y=127, z=42] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=7, n=6, x=216, y=127, z=42] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=7, n=7, x=343, y=169, z=48] [L33] EXPR counter++ VAL [a=20, counter=8, counter++=7, n=7, x=343, y=169, z=48] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=8, n=7, x=343, y=169, z=48] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=8, n=7, x=343, y=169, z=48] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=8, n=7, x=343, y=169, z=48] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=8, n=7, x=343, y=169, z=48] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=8, n=7, x=343, y=169, z=48] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=8, n=8, x=512, y=217, z=54] [L33] EXPR counter++ VAL [a=20, counter=9, counter++=8, n=8, x=512, y=217, z=54] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=9, n=8, x=512, y=217, z=54] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=9, n=8, x=512, y=217, z=54] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=9, n=8, x=512, y=217, z=54] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=9, n=8, x=512, y=217, z=54] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=9, n=8, x=512, y=217, z=54] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=9, n=9, x=729, y=271, z=60] [L33] EXPR counter++ VAL [a=20, counter=10, counter++=9, n=9, x=729, y=271, z=60] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=10, n=9, x=729, y=271, z=60] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=10, n=9, x=729, y=271, z=60] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=10, n=9, x=729, y=271, z=60] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=10, n=9, x=729, y=271, z=60] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=10, n=9, x=729, y=271, z=60] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=10, n=10, x=1000, y=331, z=66] [L33] EXPR counter++ VAL [a=20, counter=11, counter++=10, n=10, x=1000, y=331, z=66] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=11, n=10, x=1000, y=331, z=66] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=11, n=10, x=1000, y=331, z=66] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=11, n=10, x=1000, y=331, z=66] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=11, n=10, x=1000, y=331, z=66] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=11, n=10, x=1000, y=331, z=66] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=11, n=11, x=1331, y=397, z=72] [L33] EXPR counter++ VAL [a=20, counter=12, counter++=11, n=11, x=1331, y=397, z=72] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=12, n=11, x=1331, y=397, z=72] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=12, n=11, x=1331, y=397, z=72] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=12, n=11, x=1331, y=397, z=72] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=12, n=11, x=1331, y=397, z=72] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=12, n=11, x=1331, y=397, z=72] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=12, n=12, x=1728, y=469, z=78] [L33] EXPR counter++ VAL [a=20, counter=13, counter++=12, n=12, x=1728, y=469, z=78] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=13, n=12, x=1728, y=469, z=78] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=13, n=12, x=1728, y=469, z=78] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=13, n=12, x=1728, y=469, z=78] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=13, n=12, x=1728, y=469, z=78] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=13, n=12, x=1728, y=469, z=78] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=13, n=13, x=2197, y=547, z=84] [L33] EXPR counter++ VAL [a=20, counter=14, counter++=13, n=13, x=2197, y=547, z=84] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=14, n=13, x=2197, y=547, z=84] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=14, n=13, x=2197, y=547, z=84] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=14, n=13, x=2197, y=547, z=84] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=14, n=13, x=2197, y=547, z=84] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=14, n=13, x=2197, y=547, z=84] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=14, n=14, x=2744, y=631, z=90] [L33] EXPR counter++ VAL [a=20, counter=15, counter++=14, n=14, x=2744, y=631, z=90] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=15, n=14, x=2744, y=631, z=90] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=15, n=14, x=2744, y=631, z=90] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=15, n=14, x=2744, y=631, z=90] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=15, n=14, x=2744, y=631, z=90] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=15, n=14, x=2744, y=631, z=90] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=15, n=15, x=3375, y=721, z=96] [L33] EXPR counter++ VAL [a=20, counter=16, counter++=15, n=15, x=3375, y=721, z=96] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=16, n=15, x=3375, y=721, z=96] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=16, n=15, x=3375, y=721, z=96] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=16, n=15, x=3375, y=721, z=96] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=16, n=15, x=3375, y=721, z=96] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=16, n=15, x=3375, y=721, z=96] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=16, n=16, x=4096, y=817, z=102] [L33] EXPR counter++ VAL [a=20, counter=17, counter++=16, n=16, x=4096, y=817, z=102] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=17, n=16, x=4096, y=817, z=102] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=17, n=16, x=4096, y=817, z=102] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=17, n=16, x=4096, y=817, z=102] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=17, n=16, x=4096, y=817, z=102] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=17, n=16, x=4096, y=817, z=102] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=17, n=17, x=4913, y=919, z=108] [L33] EXPR counter++ VAL [a=20, counter=18, counter++=17, n=17, x=4913, y=919, z=108] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=18, n=17, x=4913, y=919, z=108] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=18, n=17, x=4913, y=919, z=108] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=18, n=17, x=4913, y=919, z=108] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=18, n=17, x=4913, y=919, z=108] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=18, n=17, x=4913, y=919, z=108] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=18, n=18, x=5832, y=1027, z=114] [L33] EXPR counter++ VAL [a=20, counter=19, counter++=18, n=18, x=5832, y=1027, z=114] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=19, n=18, x=5832, y=1027, z=114] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=19, n=18, x=5832, y=1027, z=114] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=19, n=18, x=5832, y=1027, z=114] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=19, n=18, x=5832, y=1027, z=114] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=19, n=18, x=5832, y=1027, z=114] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=19, n=19, x=6859, y=1141, z=120] [L33] EXPR counter++ VAL [a=20, counter=20, counter++=19, n=19, x=6859, y=1141, z=120] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=20, n=19, x=6859, y=1141, z=120] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=20, n=19, x=6859, y=1141, z=120] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=20, n=19, x=6859, y=1141, z=120] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=20, n=19, x=6859, y=1141, z=120] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=20, n=19, x=6859, y=1141, z=120] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=20, n=20, x=8000, y=1261, z=126] [L33] EXPR counter++ VAL [a=20, counter=21, counter++=20, n=20, x=8000, y=1261, z=126] [L33] COND FALSE !(counter++<20) [L48] CALL __VERIFIER_assert(z == 6*n + 6) VAL [\old(cond)=1, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L48] RET __VERIFIER_assert(z == 6*n + 6) VAL [a=20, counter=21, n=20, x=8000, y=1261, z=126] [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) VAL [\old(cond)=0, counter=21] [L15] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=21] [L17] reach_error() VAL [\old(cond)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 250.1s, OverallIterations: 19, TraceHistogramMax: 102, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 196.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 22 mSolverCounterUnknown, 656 SdHoareTripleChecker+Valid, 81.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 544 mSDsluCounter, 2485 SdHoareTripleChecker+Invalid, 80.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1776 mSDsCounter, 668 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6637 IncrementalHoareTripleChecker+Invalid, 7327 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 668 mSolverCounterUnsat, 709 mSDtfsCounter, 6637 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2807 GetRequests, 2497 SyntacticMatches, 18 SemanticMatches, 292 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 915 ImplicationChecksByTransitivity, 140.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=570occurred in iteration=18, InterpolantAutomatonStates: 230, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 18 MinimizatonAttempts, 84 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 46.5s InterpolantComputationTime, 2063 NumberOfCodeBlocks, 1857 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 2637 ConstructedInterpolants, 2 QuantifiedInterpolants, 18756 SizeOfPredicates, 74 NumberOfNonLiveVariables, 3115 ConjunctsInSsa, 437 ConjunctsInUnsatCore, 31 InterpolantComputations, 3 PerfectInterpolantSequences, 19100/25872 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 01:49:17,309 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