./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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/egcd-ll_unwindbound10.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 0a6d36c45579adaf3871b264b96aba9fa14294bc645c23d191a4e77c149500df --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 16:18:47,054 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 16:18:47,056 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 16:18:47,104 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 16:18:47,105 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 16:18:47,106 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 16:18:47,108 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 16:18:47,109 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 16:18:47,110 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 16:18:47,110 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 16:18:47,111 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 16:18:47,112 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 16:18:47,112 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 16:18:47,113 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 16:18:47,113 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 16:18:47,114 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 16:18:47,114 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 16:18:47,115 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 16:18:47,116 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 16:18:47,117 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 16:18:47,118 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 16:18:47,125 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 16:18:47,126 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 16:18:47,129 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 16:18:47,133 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 16:18:47,140 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 16:18:47,140 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 16:18:47,140 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 16:18:47,141 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 16:18:47,142 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 16:18:47,143 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 16:18:47,143 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 16:18:47,145 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 16:18:47,145 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 16:18:47,146 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 16:18:47,146 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 16:18:47,146 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 16:18:47,147 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 16:18:47,147 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 16:18:47,147 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 16:18:47,148 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 16:18:47,150 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 16:18:47,151 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 16:18:47,176 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 16:18:47,177 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 16:18:47,177 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 16:18:47,177 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 16:18:47,178 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 16:18:47,178 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 16:18:47,178 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 16:18:47,178 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 16:18:47,179 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 16:18:47,180 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 16:18:47,180 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 16:18:47,180 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 16:18:47,180 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 16:18:47,180 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 16:18:47,180 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 16:18:47,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 16:18:47,181 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 16:18:47,181 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 16:18:47,181 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 16:18:47,182 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 16:18:47,182 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 16:18:47,183 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 16:18:47,183 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 16:18:47,183 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 16:18:47,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 16:18:47,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 16:18:47,183 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 16:18:47,183 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 16:18:47,184 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 16:18:47,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 16:18:47,184 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 16:18:47,184 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 16:18:47,184 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 16:18:47,184 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0a6d36c45579adaf3871b264b96aba9fa14294bc645c23d191a4e77c149500df [2022-07-13 16:18:47,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 16:18:47,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 16:18:47,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 16:18:47,419 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 16:18:47,420 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 16:18:47,421 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound10.c [2022-07-13 16:18:47,477 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99fe4a105/3032e2f15a1c44939cec3000904ee83b/FLAGb3483ac18 [2022-07-13 16:18:47,861 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 16:18:47,862 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound10.c [2022-07-13 16:18:47,870 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99fe4a105/3032e2f15a1c44939cec3000904ee83b/FLAGb3483ac18 [2022-07-13 16:18:47,889 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99fe4a105/3032e2f15a1c44939cec3000904ee83b [2022-07-13 16:18:47,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 16:18:47,894 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 16:18:47,896 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 16:18:47,897 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 16:18:47,899 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 16:18:47,900 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:18:47" (1/1) ... [2022-07-13 16:18:47,902 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e72ec87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:18:47, skipping insertion in model container [2022-07-13 16:18:47,902 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:18:47" (1/1) ... [2022-07-13 16:18:47,908 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 16:18:47,922 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 16:18:48,095 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound10.c[489,502] [2022-07-13 16:18:48,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 16:18:48,133 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 16:18:48,143 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound10.c[489,502] [2022-07-13 16:18:48,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 16:18:48,179 INFO L208 MainTranslator]: Completed translation [2022-07-13 16:18:48,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:18:48 WrapperNode [2022-07-13 16:18:48,180 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 16:18:48,181 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 16:18:48,181 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 16:18:48,181 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 16:18:48,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:18:48" (1/1) ... [2022-07-13 16:18:48,193 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:18:48" (1/1) ... [2022-07-13 16:18:48,211 INFO L137 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 59 [2022-07-13 16:18:48,212 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 16:18:48,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 16:18:48,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 16:18:48,213 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 16:18:48,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:18:48" (1/1) ... [2022-07-13 16:18:48,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:18:48" (1/1) ... [2022-07-13 16:18:48,228 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:18:48" (1/1) ... [2022-07-13 16:18:48,229 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:18:48" (1/1) ... [2022-07-13 16:18:48,231 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:18:48" (1/1) ... [2022-07-13 16:18:48,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:18:48" (1/1) ... [2022-07-13 16:18:48,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:18:48" (1/1) ... [2022-07-13 16:18:48,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 16:18:48,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 16:18:48,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 16:18:48,236 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 16:18:48,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:18:48" (1/1) ... [2022-07-13 16:18:48,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 16:18:48,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:18:48,265 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 16:18:48,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 16:18:48,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 16:18:48,298 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-13 16:18:48,299 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-13 16:18:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 16:18:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 16:18:48,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 16:18:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 16:18:48,299 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 16:18:48,346 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 16:18:48,348 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 16:18:48,440 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 16:18:48,448 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 16:18:48,449 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 16:18:48,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:18:48 BoogieIcfgContainer [2022-07-13 16:18:48,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 16:18:48,452 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 16:18:48,452 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 16:18:48,454 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 16:18:48,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 04:18:47" (1/3) ... [2022-07-13 16:18:48,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a705953 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 04:18:48, skipping insertion in model container [2022-07-13 16:18:48,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:18:48" (2/3) ... [2022-07-13 16:18:48,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a705953 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 04:18:48, skipping insertion in model container [2022-07-13 16:18:48,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:18:48" (3/3) ... [2022-07-13 16:18:48,456 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd-ll_unwindbound10.c [2022-07-13 16:18:48,467 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 16:18:48,468 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 16:18:48,502 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 16:18:48,508 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@73a2575b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@f18b6ed [2022-07-13 16:18:48,508 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 16:18:48,511 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-13 16:18:48,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 16:18:48,517 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:18:48,517 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:18:48,518 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:18:48,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:18:48,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1165920622, now seen corresponding path program 1 times [2022-07-13 16:18:48,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:18:48,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108453486] [2022-07-13 16:18:48,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:18:48,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:18:48,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:18:48,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 16:18:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:18:48,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 16:18:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:18:48,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 16:18:48,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:18:48,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108453486] [2022-07-13 16:18:48,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108453486] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 16:18:48,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 16:18:48,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 16:18:48,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738949048] [2022-07-13 16:18:48,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 16:18:48,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 16:18:48,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:18:48,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 16:18:48,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 16:18:48,681 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 16:18:48,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:18:48,704 INFO L93 Difference]: Finished difference Result 57 states and 89 transitions. [2022-07-13 16:18:48,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 16:18:48,707 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-07-13 16:18:48,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:18:48,712 INFO L225 Difference]: With dead ends: 57 [2022-07-13 16:18:48,712 INFO L226 Difference]: Without dead ends: 26 [2022-07-13 16:18:48,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 16:18:48,720 INFO L413 NwaCegarLoop]: 39 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, 39 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 16:18:48,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 16:18:48,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-13 16:18:48,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-07-13 16:18:48,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-13 16:18:48,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2022-07-13 16:18:48,753 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 18 [2022-07-13 16:18:48,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:18:48,754 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-07-13 16:18:48,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 16:18:48,755 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2022-07-13 16:18:48,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 16:18:48,758 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:18:48,758 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:18:48,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 16:18:48,759 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:18:48,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:18:48,761 INFO L85 PathProgramCache]: Analyzing trace with hash -542319922, now seen corresponding path program 1 times [2022-07-13 16:18:48,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:18:48,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205692679] [2022-07-13 16:18:48,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:18:48,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:18:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:18:48,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 16:18:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:18:48,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 16:18:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:18:48,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 16:18:48,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:18:48,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205692679] [2022-07-13 16:18:48,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205692679] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 16:18:48,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 16:18:48,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 16:18:48,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277499072] [2022-07-13 16:18:48,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 16:18:48,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 16:18:48,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:18:48,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 16:18:48,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 16:18:48,940 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 16:18:48,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:18:48,967 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2022-07-13 16:18:48,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 16:18:48,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-07-13 16:18:48,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:18:48,968 INFO L225 Difference]: With dead ends: 38 [2022-07-13 16:18:48,968 INFO L226 Difference]: Without dead ends: 28 [2022-07-13 16:18:48,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 16:18:48,970 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 5 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 16:18:48,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 87 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 16:18:48,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-13 16:18:48,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-13 16:18:48,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-13 16:18:48,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-07-13 16:18:48,991 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 19 [2022-07-13 16:18:48,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:18:48,993 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-07-13 16:18:48,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 16:18:48,995 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-07-13 16:18:48,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 16:18:48,996 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:18:48,996 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:18:48,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 16:18:48,997 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:18:48,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:18:48,998 INFO L85 PathProgramCache]: Analyzing trace with hash -540651626, now seen corresponding path program 1 times [2022-07-13 16:18:48,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:18:48,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660336474] [2022-07-13 16:18:48,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:18:48,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:18:49,012 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 16:18:49,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1785475216] [2022-07-13 16:18:49,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:18:49,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:18:49,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:18:49,019 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 16:18:49,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 16:18:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:18:49,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 16:18:49,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:18:49,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 16:18:49,196 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 16:18:49,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:18:49,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660336474] [2022-07-13 16:18:49,196 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 16:18:49,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785475216] [2022-07-13 16:18:49,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785475216] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 16:18:49,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 16:18:49,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 16:18:49,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545522617] [2022-07-13 16:18:49,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 16:18:49,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 16:18:49,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:18:49,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 16:18:49,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 16:18:49,204 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 16:18:49,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:18:49,301 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-07-13 16:18:49,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 16:18:49,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-07-13 16:18:49,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:18:49,304 INFO L225 Difference]: With dead ends: 45 [2022-07-13 16:18:49,304 INFO L226 Difference]: Without dead ends: 43 [2022-07-13 16:18:49,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 16:18:49,305 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 8 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 16:18:49,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 122 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 16:18:49,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-13 16:18:49,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2022-07-13 16:18:49,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 25 states have internal predecessors, (30), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-13 16:18:49,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2022-07-13 16:18:49,320 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 19 [2022-07-13 16:18:49,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:18:49,320 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2022-07-13 16:18:49,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 16:18:49,320 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2022-07-13 16:18:49,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 16:18:49,321 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:18:49,321 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:18:49,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 16:18:49,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:18:49,531 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:18:49,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:18:49,531 INFO L85 PathProgramCache]: Analyzing trace with hash -276555716, now seen corresponding path program 1 times [2022-07-13 16:18:49,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:18:49,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093884327] [2022-07-13 16:18:49,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:18:49,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:18:49,540 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 16:18:49,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [602057306] [2022-07-13 16:18:49,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:18:49,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:18:49,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:18:49,542 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 16:18:49,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 16:18:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:18:49,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-13 16:18:49,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:18:49,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 16:18:49,703 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 16:18:49,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:18:49,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093884327] [2022-07-13 16:18:49,704 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 16:18:49,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602057306] [2022-07-13 16:18:49,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602057306] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 16:18:49,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 16:18:49,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 16:18:49,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521235296] [2022-07-13 16:18:49,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 16:18:49,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 16:18:49,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:18:49,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 16:18:49,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-13 16:18:49,711 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 16:18:49,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:18:49,835 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2022-07-13 16:18:49,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 16:18:49,836 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-07-13 16:18:49,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:18:49,838 INFO L225 Difference]: With dead ends: 49 [2022-07-13 16:18:49,839 INFO L226 Difference]: Without dead ends: 47 [2022-07-13 16:18:49,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-13 16:18:49,841 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 24 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 16:18:49,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 156 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 16:18:49,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-13 16:18:49,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-07-13 16:18:49,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-13 16:18:49,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2022-07-13 16:18:49,860 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 62 transitions. Word has length 24 [2022-07-13 16:18:49,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:18:49,861 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 62 transitions. [2022-07-13 16:18:49,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 16:18:49,861 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2022-07-13 16:18:49,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 16:18:49,861 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:18:49,862 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:18:49,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-13 16:18:50,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-13 16:18:50,062 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:18:50,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:18:50,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1836785898, now seen corresponding path program 1 times [2022-07-13 16:18:50,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:18:50,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379904284] [2022-07-13 16:18:50,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:18:50,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:18:50,076 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 16:18:50,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [485365868] [2022-07-13 16:18:50,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:18:50,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:18:50,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:18:50,082 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 16:18:50,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 16:18:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:18:50,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-13 16:18:50,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:18:50,274 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 16:18:50,275 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 16:18:50,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:18:50,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379904284] [2022-07-13 16:18:50,275 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 16:18:50,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485365868] [2022-07-13 16:18:50,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485365868] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 16:18:50,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 16:18:50,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 16:18:50,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294412776] [2022-07-13 16:18:50,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 16:18:50,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 16:18:50,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:18:50,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 16:18:50,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-13 16:18:50,277 INFO L87 Difference]: Start difference. First operand 46 states and 62 transitions. Second operand has 10 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-13 16:18:50,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:18:50,405 INFO L93 Difference]: Finished difference Result 71 states and 103 transitions. [2022-07-13 16:18:50,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 16:18:50,405 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2022-07-13 16:18:50,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:18:50,408 INFO L225 Difference]: With dead ends: 71 [2022-07-13 16:18:50,408 INFO L226 Difference]: Without dead ends: 67 [2022-07-13 16:18:50,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-13 16:18:50,409 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 39 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 16:18:50,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 134 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 16:18:50,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-13 16:18:50,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-07-13 16:18:50,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 39 states have internal predecessors, (47), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-07-13 16:18:50,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 96 transitions. [2022-07-13 16:18:50,419 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 96 transitions. Word has length 29 [2022-07-13 16:18:50,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:18:50,419 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 96 transitions. [2022-07-13 16:18:50,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-13 16:18:50,420 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 96 transitions. [2022-07-13 16:18:50,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-13 16:18:50,421 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:18:50,421 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:18:50,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 16:18:50,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:18:50,636 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:18:50,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:18:50,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1071030291, now seen corresponding path program 1 times [2022-07-13 16:18:50,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:18:50,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846236881] [2022-07-13 16:18:50,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:18:50,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:18:50,644 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 16:18:50,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [499126877] [2022-07-13 16:18:50,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:18:50,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:18:50,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:18:50,660 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 16:18:50,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 16:18:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:18:50,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 16:18:50,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:18:50,718 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 16:18:50,719 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 16:18:50,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:18:50,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846236881] [2022-07-13 16:18:50,720 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 16:18:50,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499126877] [2022-07-13 16:18:50,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499126877] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 16:18:50,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 16:18:50,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 16:18:50,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192646138] [2022-07-13 16:18:50,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 16:18:50,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 16:18:50,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:18:50,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 16:18:50,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 16:18:50,723 INFO L87 Difference]: Start difference. First operand 67 states and 96 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-13 16:18:50,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:18:50,777 INFO L93 Difference]: Finished difference Result 83 states and 119 transitions. [2022-07-13 16:18:50,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 16:18:50,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 35 [2022-07-13 16:18:50,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:18:50,780 INFO L225 Difference]: With dead ends: 83 [2022-07-13 16:18:50,780 INFO L226 Difference]: Without dead ends: 81 [2022-07-13 16:18:50,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 16:18:50,782 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 5 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 16:18:50,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 128 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 16:18:50,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-13 16:18:50,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2022-07-13 16:18:50,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 45 states have internal predecessors, (50), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2022-07-13 16:18:50,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2022-07-13 16:18:50,806 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 35 [2022-07-13 16:18:50,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:18:50,807 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2022-07-13 16:18:50,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-13 16:18:50,807 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2022-07-13 16:18:50,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-13 16:18:50,811 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:18:50,811 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:18:50,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 16:18:51,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:18:51,028 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:18:51,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:18:51,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1689492770, now seen corresponding path program 1 times [2022-07-13 16:18:51,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:18:51,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168152528] [2022-07-13 16:18:51,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:18:51,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:18:51,040 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 16:18:51,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [794361422] [2022-07-13 16:18:51,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:18:51,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:18:51,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:18:51,046 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 16:18:51,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 16:18:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:18:51,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 16:18:51,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:18:51,147 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 16:18:51,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 16:18:51,206 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 16:18:51,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:18:51,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168152528] [2022-07-13 16:18:51,207 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 16:18:51,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794361422] [2022-07-13 16:18:51,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794361422] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 16:18:51,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 16:18:51,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-07-13 16:18:51,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152330484] [2022-07-13 16:18:51,208 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 16:18:51,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 16:18:51,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:18:51,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 16:18:51,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-13 16:18:51,209 INFO L87 Difference]: Start difference. First operand 74 states and 105 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-07-13 16:18:51,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:18:51,328 INFO L93 Difference]: Finished difference Result 218 states and 286 transitions. [2022-07-13 16:18:51,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 16:18:51,329 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 38 [2022-07-13 16:18:51,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:18:51,331 INFO L225 Difference]: With dead ends: 218 [2022-07-13 16:18:51,331 INFO L226 Difference]: Without dead ends: 196 [2022-07-13 16:18:51,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-13 16:18:51,332 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 56 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 16:18:51,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 213 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 16:18:51,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-13 16:18:51,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 190. [2022-07-13 16:18:51,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 108 states have (on average 1.2222222222222223) internal successors, (132), 119 states have internal predecessors, (132), 61 states have call successors, (61), 21 states have call predecessors, (61), 20 states have return successors, (54), 49 states have call predecessors, (54), 54 states have call successors, (54) [2022-07-13 16:18:51,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 247 transitions. [2022-07-13 16:18:51,349 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 247 transitions. Word has length 38 [2022-07-13 16:18:51,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:18:51,350 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 247 transitions. [2022-07-13 16:18:51,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-07-13 16:18:51,350 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 247 transitions. [2022-07-13 16:18:51,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-13 16:18:51,351 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:18:51,351 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:18:51,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 16:18:51,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:18:51,568 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:18:51,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:18:51,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1691161066, now seen corresponding path program 1 times [2022-07-13 16:18:51,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:18:51,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390331811] [2022-07-13 16:18:51,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:18:51,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:18:51,576 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 16:18:51,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [833430284] [2022-07-13 16:18:51,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:18:51,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:18:51,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:18:51,577 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 16:18:51,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 16:18:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:18:51,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 16:18:51,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:18:51,688 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-13 16:18:51,688 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 16:18:51,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:18:51,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390331811] [2022-07-13 16:18:51,688 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 16:18:51,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833430284] [2022-07-13 16:18:51,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833430284] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 16:18:51,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 16:18:51,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 16:18:51,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843782725] [2022-07-13 16:18:51,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 16:18:51,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 16:18:51,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:18:51,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 16:18:51,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 16:18:51,690 INFO L87 Difference]: Start difference. First operand 190 states and 247 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 16:18:51,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:18:51,737 INFO L93 Difference]: Finished difference Result 204 states and 260 transitions. [2022-07-13 16:18:51,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 16:18:51,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2022-07-13 16:18:51,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:18:51,739 INFO L225 Difference]: With dead ends: 204 [2022-07-13 16:18:51,739 INFO L226 Difference]: Without dead ends: 199 [2022-07-13 16:18:51,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 16:18:51,740 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 7 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 16:18:51,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 116 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 16:18:51,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-13 16:18:51,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2022-07-13 16:18:51,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 117 states have (on average 1.205128205128205) internal successors, (141), 128 states have internal predecessors, (141), 58 states have call successors, (58), 24 states have call predecessors, (58), 23 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2022-07-13 16:18:51,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 250 transitions. [2022-07-13 16:18:51,754 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 250 transitions. Word has length 38 [2022-07-13 16:18:51,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:18:51,755 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 250 transitions. [2022-07-13 16:18:51,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 16:18:51,755 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 250 transitions. [2022-07-13 16:18:51,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-13 16:18:51,755 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:18:51,755 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:18:51,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 16:18:51,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:18:51,974 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:18:51,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:18:51,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1925895455, now seen corresponding path program 1 times [2022-07-13 16:18:51,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:18:51,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882507482] [2022-07-13 16:18:51,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:18:51,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:18:51,981 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 16:18:51,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [828411067] [2022-07-13 16:18:51,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:18:51,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:18:51,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:18:51,988 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 16:18:52,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 16:18:52,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:18:52,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 16:18:52,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:18:52,089 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-13 16:18:52,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 16:18:52,174 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-13 16:18:52,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:18:52,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882507482] [2022-07-13 16:18:52,175 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 16:18:52,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828411067] [2022-07-13 16:18:52,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828411067] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 16:18:52,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 16:18:52,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-07-13 16:18:52,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294543823] [2022-07-13 16:18:52,175 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 16:18:52,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 16:18:52,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:18:52,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 16:18:52,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-13 16:18:52,177 INFO L87 Difference]: Start difference. First operand 199 states and 250 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 16:18:52,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:18:52,289 INFO L93 Difference]: Finished difference Result 228 states and 286 transitions. [2022-07-13 16:18:52,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 16:18:52,289 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 40 [2022-07-13 16:18:52,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:18:52,291 INFO L225 Difference]: With dead ends: 228 [2022-07-13 16:18:52,291 INFO L226 Difference]: Without dead ends: 212 [2022-07-13 16:18:52,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-07-13 16:18:52,292 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 20 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 16:18:52,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 84 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 16:18:52,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-07-13 16:18:52,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2022-07-13 16:18:52,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 127 states have (on average 1.1653543307086613) internal successors, (148), 138 states have internal predecessors, (148), 57 states have call successors, (57), 25 states have call predecessors, (57), 25 states have return successors, (53), 46 states have call predecessors, (53), 53 states have call successors, (53) [2022-07-13 16:18:52,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 258 transitions. [2022-07-13 16:18:52,306 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 258 transitions. Word has length 40 [2022-07-13 16:18:52,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:18:52,307 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 258 transitions. [2022-07-13 16:18:52,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 16:18:52,307 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 258 transitions. [2022-07-13 16:18:52,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-13 16:18:52,308 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:18:52,308 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:18:52,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 16:18:52,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:18:52,520 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:18:52,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:18:52,521 INFO L85 PathProgramCache]: Analyzing trace with hash 968731240, now seen corresponding path program 2 times [2022-07-13 16:18:52,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:18:52,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304171481] [2022-07-13 16:18:52,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:18:52,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:18:52,528 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 16:18:52,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1171282403] [2022-07-13 16:18:52,528 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 16:18:52,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:18:52,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:18:52,529 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 16:18:52,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 16:18:52,564 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 16:18:52,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 16:18:52,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-13 16:18:52,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:18:52,739 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-13 16:18:52,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 16:18:52,813 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-13 16:18:52,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:18:52,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304171481] [2022-07-13 16:18:52,813 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 16:18:52,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171282403] [2022-07-13 16:18:52,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171282403] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 16:18:52,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 16:18:52,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-07-13 16:18:52,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419198837] [2022-07-13 16:18:52,814 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 16:18:52,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 16:18:52,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:18:52,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 16:18:52,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 16:18:52,815 INFO L87 Difference]: Start difference. First operand 210 states and 258 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-13 16:18:53,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:18:53,310 INFO L93 Difference]: Finished difference Result 249 states and 310 transitions. [2022-07-13 16:18:53,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 16:18:53,311 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 43 [2022-07-13 16:18:53,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:18:53,313 INFO L225 Difference]: With dead ends: 249 [2022-07-13 16:18:53,313 INFO L226 Difference]: Without dead ends: 225 [2022-07-13 16:18:53,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-13 16:18:53,314 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 14 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 16:18:53,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 137 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 16:18:53,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-07-13 16:18:53,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 206. [2022-07-13 16:18:53,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 133 states have (on average 1.1278195488721805) internal successors, (150), 141 states have internal predecessors, (150), 45 states have call successors, (45), 27 states have call predecessors, (45), 27 states have return successors, (41), 37 states have call predecessors, (41), 41 states have call successors, (41) [2022-07-13 16:18:53,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 236 transitions. [2022-07-13 16:18:53,332 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 236 transitions. Word has length 43 [2022-07-13 16:18:53,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:18:53,332 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 236 transitions. [2022-07-13 16:18:53,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-13 16:18:53,332 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 236 transitions. [2022-07-13 16:18:53,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 16:18:53,333 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:18:53,333 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:18:53,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 16:18:53,549 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,SelfDestructingSolverStorable9 [2022-07-13 16:18:53,550 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:18:53,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:18:53,550 INFO L85 PathProgramCache]: Analyzing trace with hash -715006568, now seen corresponding path program 1 times [2022-07-13 16:18:53,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:18:53,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440987182] [2022-07-13 16:18:53,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:18:53,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:18:53,558 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 16:18:53,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1131211025] [2022-07-13 16:18:53,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:18:53,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:18:53,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:18:53,571 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 16:18:53,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 16:18:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:18:53,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-13 16:18:53,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:18:53,775 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-13 16:18:53,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 16:18:53,910 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-07-13 16:18:53,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:18:53,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440987182] [2022-07-13 16:18:53,910 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 16:18:53,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131211025] [2022-07-13 16:18:53,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131211025] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 16:18:53,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 16:18:53,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2022-07-13 16:18:53,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825026580] [2022-07-13 16:18:53,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 16:18:53,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 16:18:53,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:18:53,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 16:18:53,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 16:18:53,912 INFO L87 Difference]: Start difference. First operand 206 states and 236 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 16:18:53,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:18:53,959 INFO L93 Difference]: Finished difference Result 212 states and 241 transitions. [2022-07-13 16:18:53,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 16:18:53,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2022-07-13 16:18:53,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:18:53,960 INFO L225 Difference]: With dead ends: 212 [2022-07-13 16:18:53,961 INFO L226 Difference]: Without dead ends: 188 [2022-07-13 16:18:53,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-13 16:18:53,962 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 16:18:53,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 85 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 16:18:53,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-07-13 16:18:53,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2022-07-13 16:18:53,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 124 states have (on average 1.1129032258064515) internal successors, (138), 128 states have internal predecessors, (138), 36 states have call successors, (36), 24 states have call predecessors, (36), 24 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2022-07-13 16:18:53,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 208 transitions. [2022-07-13 16:18:53,977 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 208 transitions. Word has length 57 [2022-07-13 16:18:53,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:18:53,978 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 208 transitions. [2022-07-13 16:18:53,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-13 16:18:53,978 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 208 transitions. [2022-07-13 16:18:53,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-13 16:18:53,979 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:18:53,979 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:18:54,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-13 16:18:54,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:18:54,199 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:18:54,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:18:54,200 INFO L85 PathProgramCache]: Analyzing trace with hash 985491918, now seen corresponding path program 2 times [2022-07-13 16:18:54,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:18:54,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040463722] [2022-07-13 16:18:54,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:18:54,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:18:54,208 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 16:18:54,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1556241065] [2022-07-13 16:18:54,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 16:18:54,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:18:54,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:18:54,210 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) [2022-07-13 16:18:54,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 16:18:54,254 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 16:18:54,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 16:18:54,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 16:18:54,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:18:54,360 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 266 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-07-13 16:18:54,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 16:18:54,472 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 50 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-07-13 16:18:54,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:18:54,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040463722] [2022-07-13 16:18:54,472 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 16:18:54,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556241065] [2022-07-13 16:18:54,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556241065] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 16:18:54,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 16:18:54,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-07-13 16:18:54,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922081005] [2022-07-13 16:18:54,473 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 16:18:54,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 16:18:54,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:18:54,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 16:18:54,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-07-13 16:18:54,474 INFO L87 Difference]: Start difference. First operand 185 states and 208 transitions. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2022-07-13 16:18:54,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:18:54,698 INFO L93 Difference]: Finished difference Result 512 states and 601 transitions. [2022-07-13 16:18:54,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-13 16:18:54,699 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) Word has length 95 [2022-07-13 16:18:54,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:18:54,702 INFO L225 Difference]: With dead ends: 512 [2022-07-13 16:18:54,702 INFO L226 Difference]: Without dead ends: 503 [2022-07-13 16:18:54,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-07-13 16:18:54,704 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 97 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 16:18:54,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 207 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 16:18:54,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2022-07-13 16:18:54,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2022-07-13 16:18:54,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 334 states have (on average 1.095808383233533) internal successors, (366), 344 states have internal predecessors, (366), 102 states have call successors, (102), 66 states have call predecessors, (102), 66 states have return successors, (100), 92 states have call predecessors, (100), 100 states have call successors, (100) [2022-07-13 16:18:54,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 568 transitions. [2022-07-13 16:18:54,744 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 568 transitions. Word has length 95 [2022-07-13 16:18:54,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:18:54,745 INFO L495 AbstractCegarLoop]: Abstraction has 503 states and 568 transitions. [2022-07-13 16:18:54,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2022-07-13 16:18:54,746 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 568 transitions. [2022-07-13 16:18:54,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-07-13 16:18:54,752 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:18:54,752 INFO L195 NwaCegarLoop]: trace histogram [31, 30, 30, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:18:54,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-13 16:18:54,963 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,SelfDestructingSolverStorable11 [2022-07-13 16:18:54,963 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:18:54,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:18:54,964 INFO L85 PathProgramCache]: Analyzing trace with hash 325062734, now seen corresponding path program 3 times [2022-07-13 16:18:54,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:18:54,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265569418] [2022-07-13 16:18:54,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:18:54,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:18:54,974 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 16:18:54,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [849258673] [2022-07-13 16:18:54,974 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 16:18:54,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:18:54,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:18:54,976 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) [2022-07-13 16:18:54,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-13 16:18:55,096 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2022-07-13 16:18:55,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-13 16:18:55,097 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 16:18:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 16:18:55,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 16:18:55,229 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 16:18:55,230 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 16:18:55,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-13 16:18:55,449 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,SelfDestructingSolverStorable12 [2022-07-13 16:18:55,452 INFO L356 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:18:55,455 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 16:18:55,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 04:18:55 BoogieIcfgContainer [2022-07-13 16:18:55,514 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 16:18:55,515 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 16:18:55,515 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 16:18:55,515 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 16:18:55,516 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:18:48" (3/4) ... [2022-07-13 16:18:55,517 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 16:18:55,609 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 16:18:55,610 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 16:18:55,610 INFO L158 Benchmark]: Toolchain (without parser) took 7716.87ms. Allocated memory was 102.8MB in the beginning and 138.4MB in the end (delta: 35.7MB). Free memory was 65.7MB in the beginning and 91.8MB in the end (delta: -26.1MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2022-07-13 16:18:55,610 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 102.8MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 16:18:55,611 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.72ms. Allocated memory is still 102.8MB. Free memory was 65.5MB in the beginning and 78.1MB in the end (delta: -12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 16:18:55,611 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.37ms. Allocated memory is still 102.8MB. Free memory was 78.1MB in the beginning and 76.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 16:18:55,611 INFO L158 Benchmark]: Boogie Preprocessor took 22.65ms. Allocated memory is still 102.8MB. Free memory was 76.5MB in the beginning and 75.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 16:18:55,611 INFO L158 Benchmark]: RCFGBuilder took 214.63ms. Allocated memory is still 102.8MB. Free memory was 75.4MB in the beginning and 65.5MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 16:18:55,611 INFO L158 Benchmark]: TraceAbstraction took 7062.95ms. Allocated memory was 102.8MB in the beginning and 138.4MB in the end (delta: 35.7MB). Free memory was 64.9MB in the beginning and 100.2MB in the end (delta: -35.2MB). Peak memory consumption was 66.9MB. Max. memory is 16.1GB. [2022-07-13 16:18:55,612 INFO L158 Benchmark]: Witness Printer took 94.65ms. Allocated memory is still 138.4MB. Free memory was 100.2MB in the beginning and 91.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 16:18:55,613 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 102.8MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 283.72ms. Allocated memory is still 102.8MB. Free memory was 65.5MB in the beginning and 78.1MB in the end (delta: -12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.37ms. Allocated memory is still 102.8MB. Free memory was 78.1MB in the beginning and 76.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.65ms. Allocated memory is still 102.8MB. Free memory was 76.5MB in the beginning and 75.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 214.63ms. Allocated memory is still 102.8MB. Free memory was 75.4MB in the beginning and 65.5MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7062.95ms. Allocated memory was 102.8MB in the beginning and 138.4MB in the end (delta: 35.7MB). Free memory was 64.9MB in the beginning and 100.2MB in the end (delta: -35.2MB). Peak memory consumption was 66.9MB. Max. memory is 16.1GB. * Witness Printer took 94.65ms. Allocated memory is still 138.4MB. Free memory was 100.2MB in the beginning and 91.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; VAL [counter=0] [L20] long long a, b, p, q, r, s; [L21] int x, y; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [counter=0, x=12, y=1] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) VAL [counter=0, x=12, y=1] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [a=12, b=1, counter=0, p=1, q=0, r=0, s=1, x=12, y=1] [L34] EXPR counter++ VAL [a=12, b=1, counter=1, counter++=0, p=1, q=0, r=0, s=1, x=12, y=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=12, b=1, counter=1, p=1, q=0, r=0, s=1, x=12, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=12, b=1, counter=1, p=1, q=0, r=0, s=1, x=12, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=12, b=1, counter=1, p=1, q=0, r=0, s=1, x=12, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=12, b=1, counter=1, p=1, q=0, r=0, s=1, x=12, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=11, b=1, counter=1, p=1, q=0, r=-1, s=1, x=12, y=1] [L34] EXPR counter++ VAL [a=11, b=1, counter=2, counter++=1, p=1, q=0, r=-1, s=1, x=12, y=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=11, b=1, counter=2, p=1, q=0, r=-1, s=1, x=12, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=11, b=1, counter=2, p=1, q=0, r=-1, s=1, x=12, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=11, b=1, counter=2, p=1, q=0, r=-1, s=1, x=12, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=11, b=1, counter=2, p=1, q=0, r=-1, s=1, x=12, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=10, b=1, counter=2, p=1, q=0, r=-2, s=1, x=12, y=1] [L34] EXPR counter++ VAL [a=10, b=1, counter=3, counter++=2, p=1, q=0, r=-2, s=1, x=12, y=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=10, b=1, counter=3, p=1, q=0, r=-2, s=1, x=12, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=10, b=1, counter=3, p=1, q=0, r=-2, s=1, x=12, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=10, b=1, counter=3, p=1, q=0, r=-2, s=1, x=12, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=10, b=1, counter=3, p=1, q=0, r=-2, s=1, x=12, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=9, b=1, counter=3, p=1, q=0, r=-3, s=1, x=12, y=1] [L34] EXPR counter++ VAL [a=9, b=1, counter=4, counter++=3, p=1, q=0, r=-3, s=1, x=12, y=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=9, b=1, counter=4, p=1, q=0, r=-3, s=1, x=12, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=9, b=1, counter=4, p=1, q=0, r=-3, s=1, x=12, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=9, b=1, counter=4, p=1, q=0, r=-3, s=1, x=12, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=9, b=1, counter=4, p=1, q=0, r=-3, s=1, x=12, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=8, b=1, counter=4, p=1, q=0, r=-4, s=1, x=12, y=1] [L34] EXPR counter++ VAL [a=8, b=1, counter=5, counter++=4, p=1, q=0, r=-4, s=1, x=12, y=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=8, b=1, counter=5, p=1, q=0, r=-4, s=1, x=12, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=8, b=1, counter=5, p=1, q=0, r=-4, s=1, x=12, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=8, b=1, counter=5, p=1, q=0, r=-4, s=1, x=12, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=8, b=1, counter=5, p=1, q=0, r=-4, s=1, x=12, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=7, b=1, counter=5, p=1, q=0, r=-5, s=1, x=12, y=1] [L34] EXPR counter++ VAL [a=7, b=1, counter=6, counter++=5, p=1, q=0, r=-5, s=1, x=12, y=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=7, b=1, counter=6, p=1, q=0, r=-5, s=1, x=12, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=7, b=1, counter=6, p=1, q=0, r=-5, s=1, x=12, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=7, b=1, counter=6, p=1, q=0, r=-5, s=1, x=12, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=7, b=1, counter=6, p=1, q=0, r=-5, s=1, x=12, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=6, b=1, counter=6, p=1, q=0, r=-6, s=1, x=12, y=1] [L34] EXPR counter++ VAL [a=6, b=1, counter=7, counter++=6, p=1, q=0, r=-6, s=1, x=12, y=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=6, b=1, counter=7, p=1, q=0, r=-6, s=1, x=12, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=6, b=1, counter=7, p=1, q=0, r=-6, s=1, x=12, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=6, b=1, counter=7, p=1, q=0, r=-6, s=1, x=12, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=6, b=1, counter=7, p=1, q=0, r=-6, s=1, x=12, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=5, b=1, counter=7, p=1, q=0, r=-7, s=1, x=12, y=1] [L34] EXPR counter++ VAL [a=5, b=1, counter=8, counter++=7, p=1, q=0, r=-7, s=1, x=12, y=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=5, b=1, counter=8, p=1, q=0, r=-7, s=1, x=12, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=5, b=1, counter=8, p=1, q=0, r=-7, s=1, x=12, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=5, b=1, counter=8, p=1, q=0, r=-7, s=1, x=12, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=5, b=1, counter=8, p=1, q=0, r=-7, s=1, x=12, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=4, b=1, counter=8, p=1, q=0, r=-8, s=1, x=12, y=1] [L34] EXPR counter++ VAL [a=4, b=1, counter=9, counter++=8, p=1, q=0, r=-8, s=1, x=12, y=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=4, b=1, counter=9, p=1, q=0, r=-8, s=1, x=12, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=4, b=1, counter=9, p=1, q=0, r=-8, s=1, x=12, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=4, b=1, counter=9, p=1, q=0, r=-8, s=1, x=12, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=4, b=1, counter=9, p=1, q=0, r=-8, s=1, x=12, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=3, b=1, counter=9, p=1, q=0, r=-9, s=1, x=12, y=1] [L34] EXPR counter++ VAL [a=3, b=1, counter=10, counter++=9, p=1, q=0, r=-9, s=1, x=12, y=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=3, b=1, counter=10, p=1, q=0, r=-9, s=1, x=12, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=3, b=1, counter=10, p=1, q=0, r=-9, s=1, x=12, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=3, b=1, counter=10, p=1, q=0, r=-9, s=1, x=12, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=3, b=1, counter=10, p=1, q=0, r=-9, s=1, x=12, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=2, b=1, counter=10, p=1, q=0, r=-10, s=1, x=12, y=1] [L34] EXPR counter++ VAL [a=2, b=1, counter=11, counter++=10, p=1, q=0, r=-10, s=1, x=12, y=1] [L34] COND FALSE !(counter++<10) [L53] CALL __VERIFIER_assert(a - b == 0) VAL [\old(cond)=0, counter=11] [L11] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=11] [L13] reach_error() VAL [\old(cond)=0, cond=0, counter=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 13, TraceHistogramMax: 31, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 322 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 282 mSDsluCounter, 1508 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1055 mSDsCounter, 160 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 862 IncrementalHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 160 mSolverCounterUnsat, 453 mSDtfsCounter, 862 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 717 GetRequests, 622 SyntacticMatches, 6 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=503occurred in iteration=12, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 39 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 664 NumberOfCodeBlocks, 664 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 711 ConstructedInterpolants, 0 QuantifiedInterpolants, 2313 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1213 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 17 InterpolantComputations, 8 PerfectInterpolantSequences, 784/1139 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-13 16:18:55,631 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