./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26d01a9c 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_unwindbound20.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4aef2940f6d326843487f003443fc222e2136d386047f492f8bd5c7e21afc8f5 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 01:40:44,830 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 01:40:44,832 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 01:40:44,866 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 01:40:44,866 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 01:40:44,869 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 01:40:44,870 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 01:40:44,872 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 01:40:44,874 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 01:40:44,878 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 01:40:44,879 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 01:40:44,880 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 01:40:44,880 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 01:40:44,881 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 01:40:44,882 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 01:40:44,883 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 01:40:44,884 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 01:40:44,884 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 01:40:44,886 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 01:40:44,888 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 01:40:44,890 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 01:40:44,890 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 01:40:44,891 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 01:40:44,892 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 01:40:44,896 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 01:40:44,896 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 01:40:44,896 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 01:40:44,897 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 01:40:44,898 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 01:40:44,898 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 01:40:44,899 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 01:40:44,899 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 01:40:44,900 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 01:40:44,901 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 01:40:44,901 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 01:40:44,901 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 01:40:44,902 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 01:40:44,902 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 01:40:44,902 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 01:40:44,902 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 01:40:44,903 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 01:40:44,904 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 01:40:44,939 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 01:40:44,940 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 01:40:44,940 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 01:40:44,940 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 01:40:44,941 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 01:40:44,941 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 01:40:44,942 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 01:40:44,942 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 01:40:44,942 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 01:40:44,942 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 01:40:44,943 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 01:40:44,943 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 01:40:44,943 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 01:40:44,943 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 01:40:44,943 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 01:40:44,943 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 01:40:44,943 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 01:40:44,944 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 01:40:44,944 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 01:40:44,944 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 01:40:44,944 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 01:40:44,944 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 01:40:44,944 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 01:40:44,944 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 01:40:44,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 01:40:44,945 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 01:40:44,945 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 01:40:44,945 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 01:40:44,945 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 01:40:44,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 01:40:44,946 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 01:40:44,946 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 01:40:44,946 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 01:40:44,946 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 01:40:44,946 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 01:40:44,946 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4aef2940f6d326843487f003443fc222e2136d386047f492f8bd5c7e21afc8f5 [2023-02-17 01:40:45,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 01:40:45,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 01:40:45,134 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 01:40:45,135 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 01:40:45,135 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 01:40:45,136 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound20.c [2023-02-17 01:40:46,118 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 01:40:46,256 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 01:40:46,256 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound20.c [2023-02-17 01:40:46,260 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/110dfdb49/277ff4b8a6e44f04acd947599ffbc748/FLAGd8216ee63 [2023-02-17 01:40:46,269 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/110dfdb49/277ff4b8a6e44f04acd947599ffbc748 [2023-02-17 01:40:46,271 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 01:40:46,272 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 01:40:46,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 01:40:46,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 01:40:46,275 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 01:40:46,275 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 01:40:46" (1/1) ... [2023-02-17 01:40:46,276 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ed36ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:40:46, skipping insertion in model container [2023-02-17 01:40:46,276 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 01:40:46" (1/1) ... [2023-02-17 01:40:46,281 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 01:40:46,292 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 01:40:46,378 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound20.c[489,502] [2023-02-17 01:40:46,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 01:40:46,395 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 01:40:46,402 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd-ll_unwindbound20.c[489,502] [2023-02-17 01:40:46,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 01:40:46,417 INFO L208 MainTranslator]: Completed translation [2023-02-17 01:40:46,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:40:46 WrapperNode [2023-02-17 01:40:46,417 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 01:40:46,418 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 01:40:46,418 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 01:40:46,418 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 01:40:46,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:40:46" (1/1) ... [2023-02-17 01:40:46,427 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:40:46" (1/1) ... [2023-02-17 01:40:46,444 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 59 [2023-02-17 01:40:46,444 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 01:40:46,445 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 01:40:46,445 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 01:40:46,445 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 01:40:46,452 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:40:46" (1/1) ... [2023-02-17 01:40:46,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:40:46" (1/1) ... [2023-02-17 01:40:46,462 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:40:46" (1/1) ... [2023-02-17 01:40:46,462 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:40:46" (1/1) ... [2023-02-17 01:40:46,468 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:40:46" (1/1) ... [2023-02-17 01:40:46,476 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:40:46" (1/1) ... [2023-02-17 01:40:46,478 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:40:46" (1/1) ... [2023-02-17 01:40:46,479 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:40:46" (1/1) ... [2023-02-17 01:40:46,480 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 01:40:46,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 01:40:46,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 01:40:46,485 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 01:40:46,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:40:46" (1/1) ... [2023-02-17 01:40:46,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 01:40:46,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:40:46,508 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-17 01:40:46,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-17 01:40:46,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 01:40:46,538 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-17 01:40:46,538 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-17 01:40:46,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 01:40:46,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 01:40:46,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 01:40:46,539 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-17 01:40:46,539 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-17 01:40:46,586 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 01:40:46,588 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 01:40:46,731 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 01:40:46,735 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 01:40:46,735 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-17 01:40:46,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 01:40:46 BoogieIcfgContainer [2023-02-17 01:40:46,752 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 01:40:46,754 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 01:40:46,754 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 01:40:46,757 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 01:40:46,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 01:40:46" (1/3) ... [2023-02-17 01:40:46,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@652d29d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 01:40:46, skipping insertion in model container [2023-02-17 01:40:46,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 01:40:46" (2/3) ... [2023-02-17 01:40:46,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@652d29d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 01:40:46, skipping insertion in model container [2023-02-17 01:40:46,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 01:40:46" (3/3) ... [2023-02-17 01:40:46,759 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd-ll_unwindbound20.c [2023-02-17 01:40:46,785 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 01:40:46,786 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 01:40:46,827 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 01:40:46,831 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3ce38db8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 01:40:46,831 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 01:40:46,834 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) [2023-02-17 01:40:46,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-17 01:40:46,841 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:40:46,841 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:40:46,842 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:40:46,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:40:46,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1165920622, now seen corresponding path program 1 times [2023-02-17 01:40:46,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:40:46,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187579235] [2023-02-17 01:40:46,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:40:46,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:40:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:40:46,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 01:40:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:40:47,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-17 01:40:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:40:47,017 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 01:40:47,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:40:47,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187579235] [2023-02-17 01:40:47,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187579235] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 01:40:47,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 01:40:47,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 01:40:47,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912105646] [2023-02-17 01:40:47,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 01:40:47,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 01:40:47,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:40:47,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 01:40:47,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 01:40:47,057 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) [2023-02-17 01:40:47,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:40:47,078 INFO L93 Difference]: Finished difference Result 57 states and 89 transitions. [2023-02-17 01:40:47,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 01:40:47,079 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 [2023-02-17 01:40:47,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:40:47,085 INFO L225 Difference]: With dead ends: 57 [2023-02-17 01:40:47,085 INFO L226 Difference]: Without dead ends: 26 [2023-02-17 01:40:47,091 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 [2023-02-17 01:40:47,093 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 [2023-02-17 01:40:47,094 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] [2023-02-17 01:40:47,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-02-17 01:40:47,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-02-17 01:40:47,120 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) [2023-02-17 01:40:47,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2023-02-17 01:40:47,123 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 18 [2023-02-17 01:40:47,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:40:47,123 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2023-02-17 01:40:47,123 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) [2023-02-17 01:40:47,124 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2023-02-17 01:40:47,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-17 01:40:47,126 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:40:47,126 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:40:47,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 01:40:47,127 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:40:47,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:40:47,129 INFO L85 PathProgramCache]: Analyzing trace with hash -542319922, now seen corresponding path program 1 times [2023-02-17 01:40:47,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:40:47,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296969038] [2023-02-17 01:40:47,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:40:47,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:40:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:40:47,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 01:40:47,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:40:47,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-02-17 01:40:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:40:47,262 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 01:40:47,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:40:47,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296969038] [2023-02-17 01:40:47,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296969038] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 01:40:47,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 01:40:47,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 01:40:47,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126996557] [2023-02-17 01:40:47,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 01:40:47,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 01:40:47,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:40:47,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 01:40:47,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 01:40:47,265 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) [2023-02-17 01:40:47,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:40:47,300 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2023-02-17 01:40:47,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 01:40:47,301 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 [2023-02-17 01:40:47,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:40:47,303 INFO L225 Difference]: With dead ends: 38 [2023-02-17 01:40:47,303 INFO L226 Difference]: Without dead ends: 28 [2023-02-17 01:40:47,304 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 [2023-02-17 01:40:47,305 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 [2023-02-17 01:40:47,305 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] [2023-02-17 01:40:47,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-17 01:40:47,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-02-17 01:40:47,310 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) [2023-02-17 01:40:47,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2023-02-17 01:40:47,315 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 19 [2023-02-17 01:40:47,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:40:47,316 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2023-02-17 01:40:47,316 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) [2023-02-17 01:40:47,317 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2023-02-17 01:40:47,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-17 01:40:47,317 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:40:47,318 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:40:47,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 01:40:47,318 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:40:47,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:40:47,319 INFO L85 PathProgramCache]: Analyzing trace with hash -540651626, now seen corresponding path program 1 times [2023-02-17 01:40:47,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:40:47,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889945520] [2023-02-17 01:40:47,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:40:47,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:40:47,329 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:40:47,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [161131989] [2023-02-17 01:40:47,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:40:47,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:40:47,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:40:47,333 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:40:47,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-17 01:40:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:40:47,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 01:40:47,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:40:47,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 01:40:47,449 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 01:40:47,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:40:47,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889945520] [2023-02-17 01:40:47,449 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:40:47,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161131989] [2023-02-17 01:40:47,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161131989] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 01:40:47,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 01:40:47,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-17 01:40:47,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789200990] [2023-02-17 01:40:47,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 01:40:47,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 01:40:47,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:40:47,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 01:40:47,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-17 01:40:47,452 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 01:40:47,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:40:47,552 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2023-02-17 01:40:47,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 01:40:47,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2023-02-17 01:40:47,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:40:47,554 INFO L225 Difference]: With dead ends: 45 [2023-02-17 01:40:47,554 INFO L226 Difference]: Without dead ends: 43 [2023-02-17 01:40:47,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-17 01:40:47,555 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 10 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 01:40:47,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 156 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 01:40:47,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-02-17 01:40:47,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2023-02-17 01:40:47,562 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) [2023-02-17 01:40:47,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2023-02-17 01:40:47,563 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 19 [2023-02-17 01:40:47,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:40:47,564 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2023-02-17 01:40:47,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 01:40:47,564 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2023-02-17 01:40:47,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-17 01:40:47,565 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:40:47,565 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] [2023-02-17 01:40:47,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-17 01:40:47,774 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 [2023-02-17 01:40:47,774 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:40:47,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:40:47,775 INFO L85 PathProgramCache]: Analyzing trace with hash -276555716, now seen corresponding path program 1 times [2023-02-17 01:40:47,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:40:47,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883566032] [2023-02-17 01:40:47,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:40:47,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:40:47,781 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:40:47,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1102550406] [2023-02-17 01:40:47,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:40:47,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:40:47,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:40:47,786 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:40:47,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-17 01:40:47,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:40:47,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-17 01:40:47,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:40:47,921 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 01:40:47,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:40:47,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:40:47,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883566032] [2023-02-17 01:40:47,983 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:40:47,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102550406] [2023-02-17 01:40:47,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102550406] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 01:40:47,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 01:40:47,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2023-02-17 01:40:47,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294087682] [2023-02-17 01:40:47,984 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 01:40:47,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 01:40:47,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:40:47,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 01:40:47,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-02-17 01:40:47,985 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-17 01:40:48,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:40:48,112 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2023-02-17 01:40:48,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 01:40:48,113 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2023-02-17 01:40:48,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:40:48,113 INFO L225 Difference]: With dead ends: 49 [2023-02-17 01:40:48,114 INFO L226 Difference]: Without dead ends: 47 [2023-02-17 01:40:48,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2023-02-17 01:40:48,115 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 35 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 01:40:48,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 84 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 01:40:48,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-17 01:40:48,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2023-02-17 01:40:48,123 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) [2023-02-17 01:40:48,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2023-02-17 01:40:48,125 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 62 transitions. Word has length 24 [2023-02-17 01:40:48,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:40:48,126 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 62 transitions. [2023-02-17 01:40:48,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-17 01:40:48,126 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2023-02-17 01:40:48,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-17 01:40:48,127 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:40:48,127 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] [2023-02-17 01:40:48,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-17 01:40:48,341 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 [2023-02-17 01:40:48,341 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:40:48,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:40:48,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1836785898, now seen corresponding path program 1 times [2023-02-17 01:40:48,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:40:48,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946409543] [2023-02-17 01:40:48,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:40:48,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:40:48,350 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:40:48,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [594529661] [2023-02-17 01:40:48,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:40:48,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:40:48,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:40:48,364 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:40:48,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-17 01:40:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:40:48,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-17 01:40:48,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:40:48,477 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 01:40:48,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:40:48,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:40:48,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946409543] [2023-02-17 01:40:48,535 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:40:48,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594529661] [2023-02-17 01:40:48,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594529661] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 01:40:48,535 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 01:40:48,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2023-02-17 01:40:48,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415507986] [2023-02-17 01:40:48,536 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 01:40:48,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 01:40:48,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:40:48,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 01:40:48,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-02-17 01:40:48,539 INFO L87 Difference]: Start difference. First operand 46 states and 62 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-17 01:40:48,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:40:48,693 INFO L93 Difference]: Finished difference Result 71 states and 103 transitions. [2023-02-17 01:40:48,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 01:40:48,694 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2023-02-17 01:40:48,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:40:48,696 INFO L225 Difference]: With dead ends: 71 [2023-02-17 01:40:48,697 INFO L226 Difference]: Without dead ends: 67 [2023-02-17 01:40:48,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2023-02-17 01:40:48,699 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 01:40:48,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 77 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 01:40:48,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-02-17 01:40:48,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-02-17 01:40:48,717 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) [2023-02-17 01:40:48,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 96 transitions. [2023-02-17 01:40:48,719 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 96 transitions. Word has length 29 [2023-02-17 01:40:48,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:40:48,719 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 96 transitions. [2023-02-17 01:40:48,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-17 01:40:48,720 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 96 transitions. [2023-02-17 01:40:48,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-17 01:40:48,720 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:40:48,721 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] [2023-02-17 01:40:48,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-17 01:40:48,925 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 [2023-02-17 01:40:48,926 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:40:48,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:40:48,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1071030291, now seen corresponding path program 1 times [2023-02-17 01:40:48,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:40:48,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548591341] [2023-02-17 01:40:48,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:40:48,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:40:48,933 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:40:48,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [267096682] [2023-02-17 01:40:48,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:40:48,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:40:48,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:40:48,935 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:40:48,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-17 01:40:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:40:48,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 01:40:48,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:40:48,976 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-17 01:40:48,976 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 01:40:48,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:40:48,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548591341] [2023-02-17 01:40:48,976 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:40:48,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267096682] [2023-02-17 01:40:48,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267096682] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 01:40:48,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 01:40:48,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 01:40:48,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095932605] [2023-02-17 01:40:48,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 01:40:48,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 01:40:48,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:40:48,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 01:40:48,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 01:40:48,979 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) [2023-02-17 01:40:49,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:40:49,008 INFO L93 Difference]: Finished difference Result 83 states and 119 transitions. [2023-02-17 01:40:49,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 01:40:49,009 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 [2023-02-17 01:40:49,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:40:49,010 INFO L225 Difference]: With dead ends: 83 [2023-02-17 01:40:49,010 INFO L226 Difference]: Without dead ends: 81 [2023-02-17 01:40:49,010 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 [2023-02-17 01:40:49,010 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 [2023-02-17 01:40:49,011 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] [2023-02-17 01:40:49,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-17 01:40:49,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2023-02-17 01:40:49,018 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) [2023-02-17 01:40:49,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2023-02-17 01:40:49,019 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 35 [2023-02-17 01:40:49,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:40:49,019 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2023-02-17 01:40:49,019 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) [2023-02-17 01:40:49,019 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2023-02-17 01:40:49,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-17 01:40:49,020 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:40:49,020 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] [2023-02-17 01:40:49,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-17 01:40:49,225 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 [2023-02-17 01:40:49,225 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:40:49,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:40:49,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1689492770, now seen corresponding path program 1 times [2023-02-17 01:40:49,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:40:49,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409585903] [2023-02-17 01:40:49,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:40:49,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:40:49,231 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:40:49,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1577752207] [2023-02-17 01:40:49,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:40:49,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:40:49,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:40:49,233 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:40:49,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-17 01:40:49,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:40:49,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 01:40:49,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:40:49,283 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-17 01:40:49,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:40:49,297 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-17 01:40:49,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:40:49,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409585903] [2023-02-17 01:40:49,301 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:40:49,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577752207] [2023-02-17 01:40:49,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577752207] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:40:49,302 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:40:49,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-02-17 01:40:49,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301626562] [2023-02-17 01:40:49,302 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:40:49,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 01:40:49,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:40:49,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 01:40:49,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-17 01:40:49,303 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) [2023-02-17 01:40:49,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:40:49,401 INFO L93 Difference]: Finished difference Result 218 states and 286 transitions. [2023-02-17 01:40:49,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 01:40:49,401 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 [2023-02-17 01:40:49,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:40:49,404 INFO L225 Difference]: With dead ends: 218 [2023-02-17 01:40:49,404 INFO L226 Difference]: Without dead ends: 196 [2023-02-17 01:40:49,405 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 [2023-02-17 01:40:49,406 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 47 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 01:40:49,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 222 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 01:40:49,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-02-17 01:40:49,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 190. [2023-02-17 01:40:49,436 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) [2023-02-17 01:40:49,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 247 transitions. [2023-02-17 01:40:49,437 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 247 transitions. Word has length 38 [2023-02-17 01:40:49,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:40:49,438 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 247 transitions. [2023-02-17 01:40:49,438 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) [2023-02-17 01:40:49,438 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 247 transitions. [2023-02-17 01:40:49,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-17 01:40:49,442 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:40:49,443 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] [2023-02-17 01:40:49,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-17 01:40:49,647 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 [2023-02-17 01:40:49,650 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:40:49,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:40:49,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1691161066, now seen corresponding path program 1 times [2023-02-17 01:40:49,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:40:49,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024095963] [2023-02-17 01:40:49,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:40:49,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:40:49,656 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:40:49,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1386474486] [2023-02-17 01:40:49,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:40:49,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:40:49,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:40:49,661 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:40:49,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-17 01:40:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:40:49,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-17 01:40:49,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:40:49,719 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-17 01:40:49,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:40:49,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:40:49,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024095963] [2023-02-17 01:40:49,774 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:40:49,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386474486] [2023-02-17 01:40:49,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386474486] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 01:40:49,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-02-17 01:40:49,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2023-02-17 01:40:49,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565660146] [2023-02-17 01:40:49,775 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-02-17 01:40:49,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 01:40:49,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:40:49,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 01:40:49,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-02-17 01:40:49,776 INFO L87 Difference]: Start difference. First operand 190 states and 247 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-17 01:40:49,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:40:49,855 INFO L93 Difference]: Finished difference Result 204 states and 260 transitions. [2023-02-17 01:40:49,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 01:40:49,855 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2023-02-17 01:40:49,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:40:49,856 INFO L225 Difference]: With dead ends: 204 [2023-02-17 01:40:49,856 INFO L226 Difference]: Without dead ends: 199 [2023-02-17 01:40:49,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-02-17 01:40:49,857 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 13 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 01:40:49,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 107 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 01:40:49,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2023-02-17 01:40:49,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2023-02-17 01:40:49,869 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) [2023-02-17 01:40:49,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 250 transitions. [2023-02-17 01:40:49,870 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 250 transitions. Word has length 38 [2023-02-17 01:40:49,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:40:49,871 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 250 transitions. [2023-02-17 01:40:49,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-17 01:40:49,871 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 250 transitions. [2023-02-17 01:40:49,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-17 01:40:49,871 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:40:49,872 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] [2023-02-17 01:40:49,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-17 01:40:50,077 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 [2023-02-17 01:40:50,077 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:40:50,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:40:50,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1925895455, now seen corresponding path program 1 times [2023-02-17 01:40:50,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:40:50,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559762961] [2023-02-17 01:40:50,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:40:50,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:40:50,091 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:40:50,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2049579426] [2023-02-17 01:40:50,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:40:50,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:40:50,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:40:50,093 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:40:50,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-17 01:40:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:40:50,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-17 01:40:50,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:40:50,174 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-17 01:40:50,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:40:50,231 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-17 01:40:50,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:40:50,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559762961] [2023-02-17 01:40:50,232 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:40:50,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049579426] [2023-02-17 01:40:50,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049579426] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:40:50,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:40:50,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2023-02-17 01:40:50,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773513219] [2023-02-17 01:40:50,235 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:40:50,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 01:40:50,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:40:50,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 01:40:50,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-02-17 01:40:50,236 INFO L87 Difference]: Start difference. First operand 199 states and 250 transitions. Second operand has 12 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-02-17 01:40:50,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:40:50,341 INFO L93 Difference]: Finished difference Result 228 states and 286 transitions. [2023-02-17 01:40:50,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 01:40:50,341 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 40 [2023-02-17 01:40:50,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:40:50,345 INFO L225 Difference]: With dead ends: 228 [2023-02-17 01:40:50,345 INFO L226 Difference]: Without dead ends: 212 [2023-02-17 01:40:50,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-02-17 01:40:50,348 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 23 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 01:40:50,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 102 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 01:40:50,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2023-02-17 01:40:50,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2023-02-17 01:40:50,367 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) [2023-02-17 01:40:50,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 258 transitions. [2023-02-17 01:40:50,369 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 258 transitions. Word has length 40 [2023-02-17 01:40:50,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:40:50,369 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 258 transitions. [2023-02-17 01:40:50,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-02-17 01:40:50,370 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 258 transitions. [2023-02-17 01:40:50,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-17 01:40:50,371 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:40:50,371 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] [2023-02-17 01:40:50,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-17 01:40:50,579 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 [2023-02-17 01:40:50,579 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:40:50,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:40:50,580 INFO L85 PathProgramCache]: Analyzing trace with hash 968731240, now seen corresponding path program 2 times [2023-02-17 01:40:50,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:40:50,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017867867] [2023-02-17 01:40:50,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:40:50,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:40:50,585 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:40:50,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [980003522] [2023-02-17 01:40:50,585 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 01:40:50,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:40:50,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:40:50,586 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:40:50,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-17 01:40:50,622 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 01:40:50,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 01:40:50,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-17 01:40:50,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:40:50,650 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-17 01:40:50,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:40:50,705 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-17 01:40:50,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:40:50,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017867867] [2023-02-17 01:40:50,706 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:40:50,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980003522] [2023-02-17 01:40:50,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980003522] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:40:50,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:40:50,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-02-17 01:40:50,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774651257] [2023-02-17 01:40:50,707 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:40:50,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 01:40:50,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:40:50,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 01:40:50,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-02-17 01:40:50,708 INFO L87 Difference]: Start difference. First operand 210 states and 258 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2023-02-17 01:40:52,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-17 01:40:52,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:40:52,530 INFO L93 Difference]: Finished difference Result 249 states and 310 transitions. [2023-02-17 01:40:52,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 01:40:52,530 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 43 [2023-02-17 01:40:52,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:40:52,531 INFO L225 Difference]: With dead ends: 249 [2023-02-17 01:40:52,532 INFO L226 Difference]: Without dead ends: 225 [2023-02-17 01:40:52,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2023-02-17 01:40:52,532 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 33 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-02-17 01:40:52,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 139 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-02-17 01:40:52,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-02-17 01:40:52,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 206. [2023-02-17 01:40:52,548 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) [2023-02-17 01:40:52,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 236 transitions. [2023-02-17 01:40:52,549 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 236 transitions. Word has length 43 [2023-02-17 01:40:52,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:40:52,549 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 236 transitions. [2023-02-17 01:40:52,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2023-02-17 01:40:52,549 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 236 transitions. [2023-02-17 01:40:52,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-17 01:40:52,550 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:40:52,550 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] [2023-02-17 01:40:52,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-17 01:40:52,754 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 [2023-02-17 01:40:52,755 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:40:52,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:40:52,755 INFO L85 PathProgramCache]: Analyzing trace with hash -715006568, now seen corresponding path program 1 times [2023-02-17 01:40:52,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:40:52,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531136773] [2023-02-17 01:40:52,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:40:52,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:40:52,761 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:40:52,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1861988444] [2023-02-17 01:40:52,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:40:52,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:40:52,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:40:52,763 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:40:52,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-17 01:40:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 01:40:52,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-17 01:40:52,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:40:52,839 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-02-17 01:40:52,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:40:52,932 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-02-17 01:40:52,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:40:52,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531136773] [2023-02-17 01:40:52,932 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:40:52,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861988444] [2023-02-17 01:40:52,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861988444] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:40:52,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:40:52,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2023-02-17 01:40:52,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325703553] [2023-02-17 01:40:52,933 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:40:52,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-17 01:40:52,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:40:52,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-17 01:40:52,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2023-02-17 01:40:52,935 INFO L87 Difference]: Start difference. First operand 206 states and 236 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 12 states have internal predecessors, (38), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2023-02-17 01:40:53,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:40:53,553 INFO L93 Difference]: Finished difference Result 218 states and 252 transitions. [2023-02-17 01:40:53,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 01:40:53,555 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 12 states have internal predecessors, (38), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 57 [2023-02-17 01:40:53,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:40:53,556 INFO L225 Difference]: With dead ends: 218 [2023-02-17 01:40:53,556 INFO L226 Difference]: Without dead ends: 191 [2023-02-17 01:40:53,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2023-02-17 01:40:53,557 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 35 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 01:40:53,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 262 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-17 01:40:53,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-02-17 01:40:53,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 185. [2023-02-17 01:40:53,574 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) [2023-02-17 01:40:53,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 208 transitions. [2023-02-17 01:40:53,575 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 208 transitions. Word has length 57 [2023-02-17 01:40:53,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:40:53,576 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 208 transitions. [2023-02-17 01:40:53,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 12 states have internal predecessors, (38), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2023-02-17 01:40:53,576 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 208 transitions. [2023-02-17 01:40:53,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-02-17 01:40:53,577 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:40:53,577 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] [2023-02-17 01:40:53,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-17 01:40:53,781 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 [2023-02-17 01:40:53,782 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:40:53,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:40:53,782 INFO L85 PathProgramCache]: Analyzing trace with hash 985491918, now seen corresponding path program 2 times [2023-02-17 01:40:53,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:40:53,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892629059] [2023-02-17 01:40:53,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:40:53,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:40:53,788 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:40:53,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1574647839] [2023-02-17 01:40:53,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 01:40:53,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:40:53,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:40:53,790 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:40:53,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-17 01:40:53,837 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 01:40:53,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 01:40:53,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-17 01:40:53,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:40:53,867 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 266 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-02-17 01:40:53,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:40:53,904 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 50 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2023-02-17 01:40:53,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:40:53,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892629059] [2023-02-17 01:40:53,905 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:40:53,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574647839] [2023-02-17 01:40:53,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574647839] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:40:53,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:40:53,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-02-17 01:40:53,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163269326] [2023-02-17 01:40:53,905 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:40:53,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 01:40:53,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:40:53,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 01:40:53,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-02-17 01:40:53,907 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) [2023-02-17 01:40:54,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:40:54,059 INFO L93 Difference]: Finished difference Result 512 states and 601 transitions. [2023-02-17 01:40:54,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-17 01:40:54,059 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 [2023-02-17 01:40:54,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:40:54,061 INFO L225 Difference]: With dead ends: 512 [2023-02-17 01:40:54,061 INFO L226 Difference]: Without dead ends: 503 [2023-02-17 01:40:54,062 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 [2023-02-17 01:40:54,062 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 67 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 01:40:54,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 198 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 01:40:54,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2023-02-17 01:40:54,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2023-02-17 01:40:54,110 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) [2023-02-17 01:40:54,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 568 transitions. [2023-02-17 01:40:54,112 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 568 transitions. Word has length 95 [2023-02-17 01:40:54,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:40:54,113 INFO L495 AbstractCegarLoop]: Abstraction has 503 states and 568 transitions. [2023-02-17 01:40:54,113 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) [2023-02-17 01:40:54,113 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 568 transitions. [2023-02-17 01:40:54,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-02-17 01:40:54,118 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:40:54,119 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] [2023-02-17 01:40:54,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-17 01:40:54,323 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 [2023-02-17 01:40:54,324 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:40:54,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:40:54,324 INFO L85 PathProgramCache]: Analyzing trace with hash 325062734, now seen corresponding path program 3 times [2023-02-17 01:40:54,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:40:54,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056196827] [2023-02-17 01:40:54,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:40:54,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:40:54,332 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:40:54,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [496907806] [2023-02-17 01:40:54,333 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 01:40:54,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:40:54,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:40:54,334 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:40:54,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-17 01:40:54,448 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2023-02-17 01:40:54,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 01:40:54,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-17 01:40:54,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 01:40:54,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 60 proven. 1955 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-02-17 01:40:54,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 01:40:54,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 60 proven. 335 refuted. 0 times theorem prover too weak. 1744 trivial. 0 not checked. [2023-02-17 01:40:54,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 01:40:54,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056196827] [2023-02-17 01:40:54,631 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-17 01:40:54,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496907806] [2023-02-17 01:40:54,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496907806] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 01:40:54,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 01:40:54,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2023-02-17 01:40:54,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487386846] [2023-02-17 01:40:54,632 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 01:40:54,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-17 01:40:54,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 01:40:54,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-17 01:40:54,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2023-02-17 01:40:54,634 INFO L87 Difference]: Start difference. First operand 503 states and 568 transitions. Second operand has 24 states, 24 states have (on average 5.333333333333333) internal successors, (128), 24 states have internal predecessors, (128), 21 states have call successors, (65), 13 states have call predecessors, (65), 12 states have return successors, (64), 20 states have call predecessors, (64), 20 states have call successors, (64) [2023-02-17 01:40:55,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 01:40:55,088 INFO L93 Difference]: Finished difference Result 1042 states and 1217 transitions. [2023-02-17 01:40:55,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-02-17 01:40:55,089 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.333333333333333) internal successors, (128), 24 states have internal predecessors, (128), 21 states have call successors, (65), 13 states have call predecessors, (65), 12 states have return successors, (64), 20 states have call predecessors, (64), 20 states have call successors, (64) Word has length 209 [2023-02-17 01:40:55,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 01:40:55,092 INFO L225 Difference]: With dead ends: 1042 [2023-02-17 01:40:55,092 INFO L226 Difference]: Without dead ends: 1033 [2023-02-17 01:40:55,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 392 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2023-02-17 01:40:55,094 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 132 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 01:40:55,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 318 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 01:40:55,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2023-02-17 01:40:55,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 1033. [2023-02-17 01:40:55,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 684 states have (on average 1.090643274853801) internal successors, (746), 704 states have internal predecessors, (746), 212 states have call successors, (212), 136 states have call predecessors, (212), 136 states have return successors, (210), 192 states have call predecessors, (210), 210 states have call successors, (210) [2023-02-17 01:40:55,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1168 transitions. [2023-02-17 01:40:55,164 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1168 transitions. Word has length 209 [2023-02-17 01:40:55,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 01:40:55,165 INFO L495 AbstractCegarLoop]: Abstraction has 1033 states and 1168 transitions. [2023-02-17 01:40:55,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.333333333333333) internal successors, (128), 24 states have internal predecessors, (128), 21 states have call successors, (65), 13 states have call predecessors, (65), 12 states have return successors, (64), 20 states have call predecessors, (64), 20 states have call successors, (64) [2023-02-17 01:40:55,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1168 transitions. [2023-02-17 01:40:55,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2023-02-17 01:40:55,170 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 01:40:55,170 INFO L195 NwaCegarLoop]: trace histogram [61, 60, 60, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:40:55,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-17 01:40:55,375 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 [2023-02-17 01:40:55,375 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 01:40:55,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 01:40:55,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1625381426, now seen corresponding path program 4 times [2023-02-17 01:40:55,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 01:40:55,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186445036] [2023-02-17 01:40:55,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 01:40:55,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 01:40:55,395 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-17 01:40:55,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1782109418] [2023-02-17 01:40:55,396 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 01:40:55,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 01:40:55,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 01:40:55,397 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 01:40:55,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-17 01:40:55,536 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 01:40:55,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-17 01:40:55,536 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 01:40:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 01:40:55,816 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 01:40:55,817 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-17 01:40:55,818 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 01:40:55,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-17 01:40:56,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-02-17 01:40:56,028 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 01:40:56,034 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 01:40:56,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 01:40:56 BoogieIcfgContainer [2023-02-17 01:40:56,130 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 01:40:56,130 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 01:40:56,130 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 01:40:56,131 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 01:40:56,131 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 01:40:46" (3/4) ... [2023-02-17 01:40:56,132 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-17 01:40:56,235 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 01:40:56,235 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 01:40:56,235 INFO L158 Benchmark]: Toolchain (without parser) took 9963.53ms. Allocated memory was 144.7MB in the beginning and 184.5MB in the end (delta: 39.8MB). Free memory was 98.3MB in the beginning and 148.3MB in the end (delta: -50.0MB). Peak memory consumption was 93.4MB. Max. memory is 16.1GB. [2023-02-17 01:40:56,236 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 144.7MB. Free memory is still 109.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 01:40:56,236 INFO L158 Benchmark]: CACSL2BoogieTranslator took 144.76ms. Allocated memory is still 144.7MB. Free memory was 97.7MB in the beginning and 87.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 01:40:56,236 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.28ms. Allocated memory is still 144.7MB. Free memory was 87.2MB in the beginning and 85.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 01:40:56,236 INFO L158 Benchmark]: Boogie Preprocessor took 39.87ms. Allocated memory is still 144.7MB. Free memory was 85.7MB in the beginning and 84.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 01:40:56,236 INFO L158 Benchmark]: RCFGBuilder took 267.67ms. Allocated memory is still 144.7MB. Free memory was 84.5MB in the beginning and 73.7MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 01:40:56,237 INFO L158 Benchmark]: TraceAbstraction took 9375.73ms. Allocated memory was 144.7MB in the beginning and 184.5MB in the end (delta: 39.8MB). Free memory was 73.1MB in the beginning and 61.0MB in the end (delta: 12.1MB). Peak memory consumption was 53.5MB. Max. memory is 16.1GB. [2023-02-17 01:40:56,237 INFO L158 Benchmark]: Witness Printer took 104.71ms. Allocated memory is still 184.5MB. Free memory was 61.0MB in the beginning and 148.3MB in the end (delta: -87.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-17 01:40:56,238 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.14ms. Allocated memory is still 144.7MB. Free memory is still 109.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 144.76ms. Allocated memory is still 144.7MB. Free memory was 97.7MB in the beginning and 87.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.28ms. Allocated memory is still 144.7MB. Free memory was 87.2MB in the beginning and 85.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.87ms. Allocated memory is still 144.7MB. Free memory was 85.7MB in the beginning and 84.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 267.67ms. Allocated memory is still 144.7MB. Free memory was 84.5MB in the beginning and 73.7MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9375.73ms. Allocated memory was 144.7MB in the beginning and 184.5MB in the end (delta: 39.8MB). Free memory was 73.1MB in the beginning and 61.0MB in the end (delta: 12.1MB). Peak memory consumption was 53.5MB. Max. memory is 16.1GB. * Witness Printer took 104.71ms. Allocated memory is still 184.5MB. Free memory was 61.0MB in the beginning and 148.3MB in the end (delta: -87.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 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=22, 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=22, y=1] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [a=22, b=1, counter=0, p=1, q=0, r=0, s=1, x=22, y=1] [L34] EXPR counter++ VAL [a=22, b=1, counter=1, counter++=0, p=1, q=0, r=0, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [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=22, b=1, counter=1, p=1, q=0, r=0, s=1, x=22, 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=22, b=1, counter=1, p=1, q=0, r=0, s=1, x=22, 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=22, b=1, counter=1, p=1, q=0, r=0, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=22, b=1, counter=1, p=1, q=0, r=0, s=1, x=22, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=21, b=1, counter=1, p=1, q=0, r=-1, s=1, x=22, y=1] [L34] EXPR counter++ VAL [a=21, b=1, counter=2, counter++=1, p=1, q=0, r=-1, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [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=21, b=1, counter=2, p=1, q=0, r=-1, s=1, x=22, 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=21, b=1, counter=2, p=1, q=0, r=-1, s=1, x=22, 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=21, b=1, counter=2, p=1, q=0, r=-1, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=21, b=1, counter=2, p=1, q=0, r=-1, s=1, x=22, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=20, b=1, counter=2, p=1, q=0, r=-2, s=1, x=22, y=1] [L34] EXPR counter++ VAL [a=20, b=1, counter=3, counter++=2, p=1, q=0, r=-2, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [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=20, b=1, counter=3, p=1, q=0, r=-2, s=1, x=22, 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=20, b=1, counter=3, p=1, q=0, r=-2, s=1, x=22, 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=20, b=1, counter=3, p=1, q=0, r=-2, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=20, b=1, counter=3, p=1, q=0, r=-2, s=1, x=22, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=19, b=1, counter=3, p=1, q=0, r=-3, s=1, x=22, y=1] [L34] EXPR counter++ VAL [a=19, b=1, counter=4, counter++=3, p=1, q=0, r=-3, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [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=19, b=1, counter=4, p=1, q=0, r=-3, s=1, x=22, 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=19, b=1, counter=4, p=1, q=0, r=-3, s=1, x=22, 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=19, b=1, counter=4, p=1, q=0, r=-3, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=19, b=1, counter=4, p=1, q=0, r=-3, s=1, x=22, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=18, b=1, counter=4, p=1, q=0, r=-4, s=1, x=22, y=1] [L34] EXPR counter++ VAL [a=18, b=1, counter=5, counter++=4, p=1, q=0, r=-4, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [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=18, b=1, counter=5, p=1, q=0, r=-4, s=1, x=22, 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=18, b=1, counter=5, p=1, q=0, r=-4, s=1, x=22, 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=18, b=1, counter=5, p=1, q=0, r=-4, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=18, b=1, counter=5, p=1, q=0, r=-4, s=1, x=22, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=17, b=1, counter=5, p=1, q=0, r=-5, s=1, x=22, y=1] [L34] EXPR counter++ VAL [a=17, b=1, counter=6, counter++=5, p=1, q=0, r=-5, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [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=17, b=1, counter=6, p=1, q=0, r=-5, s=1, x=22, 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=17, b=1, counter=6, p=1, q=0, r=-5, s=1, x=22, 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=17, b=1, counter=6, p=1, q=0, r=-5, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=17, b=1, counter=6, p=1, q=0, r=-5, s=1, x=22, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=16, b=1, counter=6, p=1, q=0, r=-6, s=1, x=22, y=1] [L34] EXPR counter++ VAL [a=16, b=1, counter=7, counter++=6, p=1, q=0, r=-6, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [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=16, b=1, counter=7, p=1, q=0, r=-6, s=1, x=22, 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=16, b=1, counter=7, p=1, q=0, r=-6, s=1, x=22, 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=16, b=1, counter=7, p=1, q=0, r=-6, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=16, b=1, counter=7, p=1, q=0, r=-6, s=1, x=22, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=15, b=1, counter=7, p=1, q=0, r=-7, s=1, x=22, y=1] [L34] EXPR counter++ VAL [a=15, b=1, counter=8, counter++=7, p=1, q=0, r=-7, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [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=15, b=1, counter=8, p=1, q=0, r=-7, s=1, x=22, 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=15, b=1, counter=8, p=1, q=0, r=-7, s=1, x=22, 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=15, b=1, counter=8, p=1, q=0, r=-7, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=15, b=1, counter=8, p=1, q=0, r=-7, s=1, x=22, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=14, b=1, counter=8, p=1, q=0, r=-8, s=1, x=22, y=1] [L34] EXPR counter++ VAL [a=14, b=1, counter=9, counter++=8, p=1, q=0, r=-8, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [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=14, b=1, counter=9, p=1, q=0, r=-8, s=1, x=22, 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=14, b=1, counter=9, p=1, q=0, r=-8, s=1, x=22, 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=14, b=1, counter=9, p=1, q=0, r=-8, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=14, b=1, counter=9, p=1, q=0, r=-8, s=1, x=22, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=13, b=1, counter=9, p=1, q=0, r=-9, s=1, x=22, y=1] [L34] EXPR counter++ VAL [a=13, b=1, counter=10, counter++=9, p=1, q=0, r=-9, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [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=13, b=1, counter=10, p=1, q=0, r=-9, s=1, x=22, 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=13, b=1, counter=10, p=1, q=0, r=-9, s=1, x=22, 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=13, b=1, counter=10, p=1, q=0, r=-9, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=13, b=1, counter=10, p=1, q=0, r=-9, s=1, x=22, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=12, b=1, counter=10, p=1, q=0, r=-10, s=1, x=22, y=1] [L34] EXPR counter++ VAL [a=12, b=1, counter=11, counter++=10, p=1, q=0, r=-10, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=12, b=1, counter=11, p=1, q=0, r=-10, s=1, x=22, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=12, b=1, counter=11, p=1, q=0, r=-10, s=1, x=22, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=12, b=1, counter=11, p=1, q=0, r=-10, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=12, b=1, counter=11, p=1, q=0, r=-10, s=1, x=22, 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=11, p=1, q=0, r=-11, s=1, x=22, y=1] [L34] EXPR counter++ VAL [a=11, b=1, counter=12, counter++=11, p=1, q=0, r=-11, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=11, b=1, counter=12, p=1, q=0, r=-11, s=1, x=22, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=11, b=1, counter=12, p=1, q=0, r=-11, s=1, x=22, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=11, b=1, counter=12, p=1, q=0, r=-11, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=11, b=1, counter=12, p=1, q=0, r=-11, s=1, x=22, 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=12, p=1, q=0, r=-12, s=1, x=22, y=1] [L34] EXPR counter++ VAL [a=10, b=1, counter=13, counter++=12, p=1, q=0, r=-12, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=10, b=1, counter=13, p=1, q=0, r=-12, s=1, x=22, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=10, b=1, counter=13, p=1, q=0, r=-12, s=1, x=22, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=10, b=1, counter=13, p=1, q=0, r=-12, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=10, b=1, counter=13, p=1, q=0, r=-12, s=1, x=22, 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=13, p=1, q=0, r=-13, s=1, x=22, y=1] [L34] EXPR counter++ VAL [a=9, b=1, counter=14, counter++=13, p=1, q=0, r=-13, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=9, b=1, counter=14, p=1, q=0, r=-13, s=1, x=22, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=9, b=1, counter=14, p=1, q=0, r=-13, s=1, x=22, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=9, b=1, counter=14, p=1, q=0, r=-13, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=9, b=1, counter=14, p=1, q=0, r=-13, s=1, x=22, 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=14, p=1, q=0, r=-14, s=1, x=22, y=1] [L34] EXPR counter++ VAL [a=8, b=1, counter=15, counter++=14, p=1, q=0, r=-14, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=8, b=1, counter=15, p=1, q=0, r=-14, s=1, x=22, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=8, b=1, counter=15, p=1, q=0, r=-14, s=1, x=22, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=8, b=1, counter=15, p=1, q=0, r=-14, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=8, b=1, counter=15, p=1, q=0, r=-14, s=1, x=22, 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=15, p=1, q=0, r=-15, s=1, x=22, y=1] [L34] EXPR counter++ VAL [a=7, b=1, counter=16, counter++=15, p=1, q=0, r=-15, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=7, b=1, counter=16, p=1, q=0, r=-15, s=1, x=22, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=7, b=1, counter=16, p=1, q=0, r=-15, s=1, x=22, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=7, b=1, counter=16, p=1, q=0, r=-15, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=7, b=1, counter=16, p=1, q=0, r=-15, s=1, x=22, 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=16, p=1, q=0, r=-16, s=1, x=22, y=1] [L34] EXPR counter++ VAL [a=6, b=1, counter=17, counter++=16, p=1, q=0, r=-16, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=6, b=1, counter=17, p=1, q=0, r=-16, s=1, x=22, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=6, b=1, counter=17, p=1, q=0, r=-16, s=1, x=22, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=6, b=1, counter=17, p=1, q=0, r=-16, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=6, b=1, counter=17, p=1, q=0, r=-16, s=1, x=22, 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=17, p=1, q=0, r=-17, s=1, x=22, y=1] [L34] EXPR counter++ VAL [a=5, b=1, counter=18, counter++=17, p=1, q=0, r=-17, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=5, b=1, counter=18, p=1, q=0, r=-17, s=1, x=22, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=5, b=1, counter=18, p=1, q=0, r=-17, s=1, x=22, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=5, b=1, counter=18, p=1, q=0, r=-17, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=5, b=1, counter=18, p=1, q=0, r=-17, s=1, x=22, 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=18, p=1, q=0, r=-18, s=1, x=22, y=1] [L34] EXPR counter++ VAL [a=4, b=1, counter=19, counter++=18, p=1, q=0, r=-18, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=4, b=1, counter=19, p=1, q=0, r=-18, s=1, x=22, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=4, b=1, counter=19, p=1, q=0, r=-18, s=1, x=22, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=4, b=1, counter=19, p=1, q=0, r=-18, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=4, b=1, counter=19, p=1, q=0, r=-18, s=1, x=22, 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=19, p=1, q=0, r=-19, s=1, x=22, y=1] [L34] EXPR counter++ VAL [a=3, b=1, counter=20, counter++=19, p=1, q=0, r=-19, s=1, x=22, y=1] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=3, b=1, counter=20, p=1, q=0, r=-19, s=1, x=22, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=3, b=1, counter=20, p=1, q=0, r=-19, s=1, x=22, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=3, b=1, counter=20, p=1, q=0, r=-19, s=1, x=22, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=3, b=1, counter=20, p=1, q=0, r=-19, s=1, x=22, 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=20, p=1, q=0, r=-20, s=1, x=22, y=1] [L34] EXPR counter++ VAL [a=2, b=1, counter=21, counter++=20, p=1, q=0, r=-20, s=1, x=22, y=1] [L34] COND FALSE !(counter++<20) [L53] CALL __VERIFIER_assert(a - b == 0) VAL [\old(cond)=0, counter=21] [L11] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=21] [L13] reach_error() VAL [\old(cond)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.2s, OverallIterations: 14, TraceHistogramMax: 61, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 478 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 441 mSDsluCounter, 1919 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1414 mSDsCounter, 180 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1848 IncrementalHoareTripleChecker+Invalid, 2028 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 180 mSolverCounterUnsat, 505 mSDtfsCounter, 1848 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1185 GetRequests, 1007 SyntacticMatches, 9 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1033occurred in iteration=13, InterpolantAutomatonStates: 151, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 42 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1063 NumberOfCodeBlocks, 1048 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1127 ConstructedInterpolants, 0 QuantifiedInterpolants, 4425 SizeOfPredicates, 60 NumberOfNonLiveVariables, 1661 ConjunctsInSsa, 207 ConjunctsInUnsatCore, 19 InterpolantComputations, 4 PerfectInterpolantSequences, 2737/5417 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-02-17 01:40:56,267 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