/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7968f31 [2022-03-17 16:54:02,823 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-17 16:54:02,824 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-17 16:54:02,874 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-17 16:54:02,874 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-17 16:54:02,876 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-17 16:54:02,878 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-17 16:54:02,881 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-17 16:54:02,882 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-17 16:54:02,886 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-17 16:54:02,887 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-17 16:54:02,888 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-17 16:54:02,888 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-17 16:54:02,890 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-17 16:54:02,891 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-17 16:54:02,893 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-17 16:54:02,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-17 16:54:02,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-17 16:54:02,897 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-17 16:54:02,902 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-17 16:54:02,904 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-17 16:54:02,905 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-17 16:54:02,906 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-17 16:54:02,906 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-17 16:54:02,908 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-17 16:54:02,913 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-17 16:54:02,913 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-17 16:54:02,913 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-17 16:54:02,914 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-17 16:54:02,914 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-17 16:54:02,915 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-17 16:54:02,915 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-17 16:54:02,917 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-17 16:54:02,917 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-17 16:54:02,918 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-17 16:54:02,918 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-17 16:54:02,919 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-17 16:54:02,919 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-17 16:54:02,919 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-17 16:54:02,919 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-17 16:54:02,920 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-17 16:54:02,921 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-17 16:54:02,922 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-03-17 16:54:02,932 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-17 16:54:02,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-17 16:54:02,934 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-17 16:54:02,934 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-17 16:54:02,935 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-17 16:54:02,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-17 16:54:02,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-17 16:54:02,935 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-17 16:54:02,935 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-17 16:54:02,936 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-17 16:54:02,936 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-17 16:54:02,936 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-17 16:54:02,936 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-17 16:54:02,936 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-17 16:54:02,936 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-17 16:54:02,937 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-17 16:54:02,937 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-17 16:54:02,937 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-17 16:54:02,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-17 16:54:02,937 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-17 16:54:02,937 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-17 16:54:02,938 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-17 16:54:02,938 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-17 16:54:03,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-17 16:54:03,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-17 16:54:03,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-17 16:54:03,170 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-17 16:54:03,170 INFO L275 PluginConnector]: CDTParser initialized [2022-03-17 16:54:03,171 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound50.c [2022-03-17 16:54:03,222 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83c9f58f1/df4b51f91576478e8ea6b777d29c4a8d/FLAG42830b87e [2022-03-17 16:54:03,622 INFO L306 CDTParser]: Found 1 translation units. [2022-03-17 16:54:03,622 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound50.c [2022-03-17 16:54:03,629 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83c9f58f1/df4b51f91576478e8ea6b777d29c4a8d/FLAG42830b87e [2022-03-17 16:54:04,014 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83c9f58f1/df4b51f91576478e8ea6b777d29c4a8d [2022-03-17 16:54:04,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-17 16:54:04,017 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-17 16:54:04,020 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-17 16:54:04,020 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-17 16:54:04,024 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-17 16:54:04,024 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:54:04" (1/1) ... [2022-03-17 16:54:04,025 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43a2b0cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:54:04, skipping insertion in model container [2022-03-17 16:54:04,025 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:54:04" (1/1) ... [2022-03-17 16:54:04,031 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-17 16:54:04,045 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-17 16:54:04,226 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound50.c[490,503] [2022-03-17 16:54:04,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-17 16:54:04,283 INFO L203 MainTranslator]: Completed pre-run [2022-03-17 16:54:04,310 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound50.c[490,503] [2022-03-17 16:54:04,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-17 16:54:04,339 INFO L208 MainTranslator]: Completed translation [2022-03-17 16:54:04,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:54:04 WrapperNode [2022-03-17 16:54:04,340 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-17 16:54:04,341 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-17 16:54:04,341 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-17 16:54:04,342 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-17 16:54:04,350 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:54:04" (1/1) ... [2022-03-17 16:54:04,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:54:04" (1/1) ... [2022-03-17 16:54:04,362 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:54:04" (1/1) ... [2022-03-17 16:54:04,362 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:54:04" (1/1) ... [2022-03-17 16:54:04,372 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:54:04" (1/1) ... [2022-03-17 16:54:04,375 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:54:04" (1/1) ... [2022-03-17 16:54:04,376 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:54:04" (1/1) ... [2022-03-17 16:54:04,377 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-17 16:54:04,378 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-17 16:54:04,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-17 16:54:04,378 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-17 16:54:04,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:54:04" (1/1) ... [2022-03-17 16:54:04,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-17 16:54:04,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:54:04,412 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-17 16:54:04,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-17 16:54:04,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-17 16:54:04,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-17 16:54:04,460 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-17 16:54:04,460 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-03-17 16:54:04,461 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-17 16:54:04,461 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-17 16:54:04,461 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-17 16:54:04,461 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-17 16:54:04,461 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-17 16:54:04,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-17 16:54:04,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-17 16:54:04,462 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-03-17 16:54:04,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-17 16:54:04,462 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-17 16:54:04,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-17 16:54:04,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-17 16:54:04,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-17 16:54:04,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-17 16:54:04,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-17 16:54:04,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-17 16:54:04,540 INFO L234 CfgBuilder]: Building ICFG [2022-03-17 16:54:04,542 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-17 16:54:04,719 INFO L275 CfgBuilder]: Performing block encoding [2022-03-17 16:54:04,724 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-17 16:54:04,724 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-17 16:54:04,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 04:54:04 BoogieIcfgContainer [2022-03-17 16:54:04,725 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-17 16:54:04,726 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-17 16:54:04,726 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-17 16:54:04,727 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-17 16:54:04,729 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 04:54:04" (1/1) ... [2022-03-17 16:54:04,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 17.03 04:54:04 BasicIcfg [2022-03-17 16:54:04,744 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-17 16:54:04,746 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-17 16:54:04,746 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-17 16:54:04,748 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-17 16:54:04,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:54:04" (1/4) ... [2022-03-17 16:54:04,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12a1c5de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:54:04, skipping insertion in model container [2022-03-17 16:54:04,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:54:04" (2/4) ... [2022-03-17 16:54:04,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12a1c5de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:54:04, skipping insertion in model container [2022-03-17 16:54:04,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 04:54:04" (3/4) ... [2022-03-17 16:54:04,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12a1c5de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 04:54:04, skipping insertion in model container [2022-03-17 16:54:04,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 17.03 04:54:04" (4/4) ... [2022-03-17 16:54:04,750 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd2-ll_unwindbound50.cJordan [2022-03-17 16:54:04,754 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-03-17 16:54:04,754 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-17 16:54:04,788 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-17 16:54:04,793 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 [2022-03-17 16:54:04,794 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-17 16:54:04,807 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-03-17 16:54:04,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-17 16:54:04,813 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:54:04,814 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:54:04,814 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:54:04,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:54:04,818 INFO L85 PathProgramCache]: Analyzing trace with hash -282167495, now seen corresponding path program 1 times [2022-03-17 16:54:04,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:54:04,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325040450] [2022-03-17 16:54:04,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:54:04,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:54:04,921 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:54:04,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1734188180] [2022-03-17 16:54:04,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:54:04,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:54:04,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:54:04,926 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 16:54:04,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-17 16:54:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:54:05,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 1 conjunts are in the unsatisfiable core [2022-03-17 16:54:05,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:54:05,106 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-17 16:54:05,106 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-17 16:54:05,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:54:05,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325040450] [2022-03-17 16:54:05,107 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:54:05,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734188180] [2022-03-17 16:54:05,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734188180] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 16:54:05,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 16:54:05,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-17 16:54:05,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811902976] [2022-03-17 16:54:05,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 16:54:05,114 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-17 16:54:05,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:54:05,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-17 16:54:05,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-17 16:54:05,137 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-17 16:54:05,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:54:05,151 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-03-17 16:54:05,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-17 16:54:05,153 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 32 [2022-03-17 16:54:05,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:54:05,159 INFO L225 Difference]: With dead ends: 39 [2022-03-17 16:54:05,159 INFO L226 Difference]: Without dead ends: 34 [2022-03-17 16:54:05,160 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-17 16:54:05,163 INFO L912 BasicCegarLoop]: 50 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, 50 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 16:54:05,164 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-17 16:54:05,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-03-17 16:54:05,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-03-17 16:54:05,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-03-17 16:54:05,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-03-17 16:54:05,196 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 32 [2022-03-17 16:54:05,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:54:05,199 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-03-17 16:54:05,199 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-17 16:54:05,199 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-03-17 16:54:05,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-17 16:54:05,201 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:54:05,202 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:54:05,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-17 16:54:05,415 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-03-17 16:54:05,416 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:54:05,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:54:05,417 INFO L85 PathProgramCache]: Analyzing trace with hash -127828113, now seen corresponding path program 1 times [2022-03-17 16:54:05,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:54:05,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083584094] [2022-03-17 16:54:05,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:54:05,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:54:05,450 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:54:05,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [934308784] [2022-03-17 16:54:05,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:54:05,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:54:05,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:54:05,456 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 16:54:05,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-17 16:54:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:54:05,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-17 16:54:05,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:54:05,700 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-17 16:54:05,701 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-17 16:54:05,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:54:05,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083584094] [2022-03-17 16:54:05,701 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:54:05,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934308784] [2022-03-17 16:54:05,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934308784] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 16:54:05,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 16:54:05,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-17 16:54:05,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715474448] [2022-03-17 16:54:05,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 16:54:05,704 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-17 16:54:05,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:54:05,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-17 16:54:05,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-17 16:54:05,709 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-17 16:54:05,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:54:05,733 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-03-17 16:54:05,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-17 16:54:05,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-03-17 16:54:05,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:54:05,734 INFO L225 Difference]: With dead ends: 36 [2022-03-17 16:54:05,734 INFO L226 Difference]: Without dead ends: 36 [2022-03-17 16:54:05,735 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-17 16:54:05,736 INFO L912 BasicCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 16:54:05,736 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-17 16:54:05,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-03-17 16:54:05,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-03-17 16:54:05,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-03-17 16:54:05,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-03-17 16:54:05,742 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 33 [2022-03-17 16:54:05,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:54:05,743 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-03-17 16:54:05,743 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-17 16:54:05,743 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-03-17 16:54:05,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-17 16:54:05,744 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:54:05,744 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:54:05,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-03-17 16:54:05,951 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-03-17 16:54:05,953 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:54:05,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:54:05,954 INFO L85 PathProgramCache]: Analyzing trace with hash 365419517, now seen corresponding path program 1 times [2022-03-17 16:54:05,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:54:05,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101032503] [2022-03-17 16:54:05,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:54:05,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:54:05,969 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:54:05,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1088427340] [2022-03-17 16:54:05,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:54:05,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:54:05,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:54:05,971 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 16:54:05,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-17 16:54:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:54:06,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-17 16:54:06,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:54:06,142 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-17 16:54:06,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 16:54:06,319 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-17 16:54:06,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:54:06,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101032503] [2022-03-17 16:54:06,320 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:54:06,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088427340] [2022-03-17 16:54:06,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088427340] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 16:54:06,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-17 16:54:06,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-03-17 16:54:06,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241546485] [2022-03-17 16:54:06,321 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-17 16:54:06,322 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-17 16:54:06,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:54:06,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-17 16:54:06,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-17 16:54:06,324 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-17 16:54:06,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:54:06,397 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-03-17 16:54:06,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-17 16:54:06,398 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-03-17 16:54:06,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:54:06,400 INFO L225 Difference]: With dead ends: 45 [2022-03-17 16:54:06,400 INFO L226 Difference]: Without dead ends: 45 [2022-03-17 16:54:06,401 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-03-17 16:54:06,402 INFO L912 BasicCegarLoop]: 39 mSDtfsCounter, 30 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 16:54:06,402 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 127 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-17 16:54:06,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-03-17 16:54:06,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2022-03-17 16:54:06,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-03-17 16:54:06,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-03-17 16:54:06,409 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 34 [2022-03-17 16:54:06,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:54:06,409 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-03-17 16:54:06,409 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-17 16:54:06,409 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-03-17 16:54:06,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-17 16:54:06,410 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:54:06,410 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:54:06,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-17 16:54:06,633 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:54:06,634 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:54:06,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:54:06,634 INFO L85 PathProgramCache]: Analyzing trace with hash 196514290, now seen corresponding path program 1 times [2022-03-17 16:54:06,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:54:06,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825841993] [2022-03-17 16:54:06,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:54:06,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:54:06,648 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:54:06,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1872323293] [2022-03-17 16:54:06,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:54:06,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:54:06,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:54:06,650 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 16:54:06,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-17 16:54:06,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:54:06,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-17 16:54:06,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:54:06,829 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-17 16:54:06,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 16:54:06,973 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-17 16:54:06,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:54:06,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825841993] [2022-03-17 16:54:06,974 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:54:06,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872323293] [2022-03-17 16:54:06,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872323293] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-17 16:54:06,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-17 16:54:06,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-03-17 16:54:06,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246276081] [2022-03-17 16:54:06,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 16:54:06,975 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-17 16:54:06,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:54:06,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-17 16:54:06,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-03-17 16:54:06,977 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-17 16:54:07,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:54:07,013 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-03-17 16:54:07,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-17 16:54:07,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2022-03-17 16:54:07,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:54:07,014 INFO L225 Difference]: With dead ends: 41 [2022-03-17 16:54:07,014 INFO L226 Difference]: Without dead ends: 41 [2022-03-17 16:54:07,015 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-03-17 16:54:07,016 INFO L912 BasicCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 16:54:07,016 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 140 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-17 16:54:07,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-03-17 16:54:07,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-03-17 16:54:07,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-03-17 16:54:07,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2022-03-17 16:54:07,021 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 36 [2022-03-17 16:54:07,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:54:07,022 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2022-03-17 16:54:07,022 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-17 16:54:07,022 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-03-17 16:54:07,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-03-17 16:54:07,023 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:54:07,023 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:54:07,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-17 16:54:07,249 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:54:07,250 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:54:07,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:54:07,250 INFO L85 PathProgramCache]: Analyzing trace with hash 56558454, now seen corresponding path program 1 times [2022-03-17 16:54:07,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:54:07,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950512334] [2022-03-17 16:54:07,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:54:07,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:54:07,268 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:54:07,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1079267953] [2022-03-17 16:54:07,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:54:07,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:54:07,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:54:07,273 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 16:54:07,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-17 16:54:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:54:07,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-17 16:54:07,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:54:07,429 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-17 16:54:07,430 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-17 16:54:07,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:54:07,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950512334] [2022-03-17 16:54:07,430 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:54:07,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079267953] [2022-03-17 16:54:07,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079267953] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 16:54:07,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 16:54:07,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-17 16:54:07,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944078608] [2022-03-17 16:54:07,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 16:54:07,431 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-17 16:54:07,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:54:07,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-17 16:54:07,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-17 16:54:07,431 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-17 16:54:07,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:54:07,459 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-03-17 16:54:07,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-17 16:54:07,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-03-17 16:54:07,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:54:07,461 INFO L225 Difference]: With dead ends: 43 [2022-03-17 16:54:07,461 INFO L226 Difference]: Without dead ends: 43 [2022-03-17 16:54:07,461 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-17 16:54:07,462 INFO L912 BasicCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 16:54:07,462 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 133 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-17 16:54:07,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-03-17 16:54:07,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-03-17 16:54:07,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-03-17 16:54:07,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2022-03-17 16:54:07,467 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 39 [2022-03-17 16:54:07,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:54:07,467 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2022-03-17 16:54:07,467 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-17 16:54:07,467 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-03-17 16:54:07,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-03-17 16:54:07,468 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:54:07,468 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:54:07,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-17 16:54:07,683 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:54:07,683 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:54:07,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:54:07,684 INFO L85 PathProgramCache]: Analyzing trace with hash 578094295, now seen corresponding path program 1 times [2022-03-17 16:54:07,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:54:07,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66244549] [2022-03-17 16:54:07,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:54:07,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:54:07,698 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:54:07,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [531251178] [2022-03-17 16:54:07,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:54:07,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:54:07,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:54:07,703 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 16:54:07,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-17 16:54:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:54:07,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-17 16:54:07,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:54:07,937 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-03-17 16:54:07,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 16:54:08,043 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-03-17 16:54:08,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:54:08,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66244549] [2022-03-17 16:54:08,044 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:54:08,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531251178] [2022-03-17 16:54:08,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531251178] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-17 16:54:08,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-17 16:54:08,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-03-17 16:54:08,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127181737] [2022-03-17 16:54:08,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 16:54:08,045 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-17 16:54:08,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:54:08,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-17 16:54:08,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-03-17 16:54:08,046 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-03-17 16:54:08,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:54:08,075 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-03-17 16:54:08,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-17 16:54:08,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2022-03-17 16:54:08,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:54:08,076 INFO L225 Difference]: With dead ends: 55 [2022-03-17 16:54:08,076 INFO L226 Difference]: Without dead ends: 55 [2022-03-17 16:54:08,076 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-03-17 16:54:08,080 INFO L912 BasicCegarLoop]: 47 mSDtfsCounter, 8 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 16:54:08,080 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 169 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-17 16:54:08,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-03-17 16:54:08,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-03-17 16:54:08,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-03-17 16:54:08,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-03-17 16:54:08,096 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 41 [2022-03-17 16:54:08,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:54:08,096 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-03-17 16:54:08,097 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-03-17 16:54:08,097 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-03-17 16:54:08,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-03-17 16:54:08,097 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:54:08,098 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:54:08,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-17 16:54:08,298 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:54:08,298 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:54:08,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:54:08,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1581112078, now seen corresponding path program 1 times [2022-03-17 16:54:08,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:54:08,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938132642] [2022-03-17 16:54:08,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:54:08,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:54:08,314 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:54:08,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1542243962] [2022-03-17 16:54:08,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:54:08,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:54:08,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:54:08,316 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 16:54:08,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-17 16:54:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:54:08,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-17 16:54:08,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:54:08,539 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-03-17 16:54:08,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 16:54:08,642 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-03-17 16:54:08,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:54:08,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938132642] [2022-03-17 16:54:08,643 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:54:08,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542243962] [2022-03-17 16:54:08,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542243962] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-17 16:54:08,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-17 16:54:08,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-03-17 16:54:08,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085237857] [2022-03-17 16:54:08,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 16:54:08,645 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-17 16:54:08,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:54:08,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-17 16:54:08,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-03-17 16:54:08,645 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-17 16:54:08,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:54:08,685 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-03-17 16:54:08,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-17 16:54:08,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2022-03-17 16:54:08,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:54:08,691 INFO L225 Difference]: With dead ends: 59 [2022-03-17 16:54:08,691 INFO L226 Difference]: Without dead ends: 59 [2022-03-17 16:54:08,693 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-03-17 16:54:08,694 INFO L912 BasicCegarLoop]: 45 mSDtfsCounter, 8 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 16:54:08,694 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 160 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-17 16:54:08,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-03-17 16:54:08,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-03-17 16:54:08,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-03-17 16:54:08,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2022-03-17 16:54:08,707 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 46 [2022-03-17 16:54:08,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:54:08,707 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2022-03-17 16:54:08,707 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-17 16:54:08,708 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2022-03-17 16:54:08,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-03-17 16:54:08,708 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:54:08,708 INFO L500 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:54:08,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-17 16:54:08,909 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:54:08,909 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:54:08,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:54:08,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1942645143, now seen corresponding path program 1 times [2022-03-17 16:54:08,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:54:08,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866499680] [2022-03-17 16:54:08,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:54:08,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:54:08,920 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:54:08,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [851858924] [2022-03-17 16:54:08,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:54:08,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:54:08,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:54:08,922 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 16:54:08,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-17 16:54:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:54:08,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-17 16:54:08,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:54:09,230 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-03-17 16:54:09,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 16:54:09,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:54:09,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866499680] [2022-03-17 16:54:09,339 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:54:09,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851858924] [2022-03-17 16:54:09,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851858924] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 16:54:09,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-17 16:54:09,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-03-17 16:54:09,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949991361] [2022-03-17 16:54:09,340 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-17 16:54:09,340 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-17 16:54:09,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:54:09,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-17 16:54:09,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-03-17 16:54:09,341 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-03-17 16:54:09,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:54:09,485 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2022-03-17 16:54:09,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-17 16:54:09,485 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-03-17 16:54:09,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:54:09,488 INFO L225 Difference]: With dead ends: 63 [2022-03-17 16:54:09,488 INFO L226 Difference]: Without dead ends: 63 [2022-03-17 16:54:09,488 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-03-17 16:54:09,489 INFO L912 BasicCegarLoop]: 29 mSDtfsCounter, 32 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 16:54:09,489 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 190 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 16:54:09,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-03-17 16:54:09,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-03-17 16:54:09,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-03-17 16:54:09,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2022-03-17 16:54:09,501 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 51 [2022-03-17 16:54:09,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:54:09,501 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2022-03-17 16:54:09,502 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-03-17 16:54:09,502 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2022-03-17 16:54:09,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-03-17 16:54:09,503 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:54:09,503 INFO L500 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:54:09,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-17 16:54:09,707 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-03-17 16:54:09,707 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:54:09,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:54:09,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1573186588, now seen corresponding path program 1 times [2022-03-17 16:54:09,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:54:09,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541722621] [2022-03-17 16:54:09,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:54:09,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:54:09,718 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:54:09,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [706910514] [2022-03-17 16:54:09,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:54:09,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:54:09,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:54:09,719 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 16:54:09,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-17 16:54:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:54:09,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-17 16:54:09,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:54:09,909 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-03-17 16:54:09,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 16:54:10,034 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-03-17 16:54:10,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:54:10,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541722621] [2022-03-17 16:54:10,034 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:54:10,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706910514] [2022-03-17 16:54:10,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706910514] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 16:54:10,035 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-17 16:54:10,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-03-17 16:54:10,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151477774] [2022-03-17 16:54:10,035 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-17 16:54:10,035 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-17 16:54:10,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:54:10,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-17 16:54:10,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-03-17 16:54:10,036 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-03-17 16:54:10,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:54:10,203 INFO L93 Difference]: Finished difference Result 207 states and 242 transitions. [2022-03-17 16:54:10,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-17 16:54:10,204 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) Word has length 60 [2022-03-17 16:54:10,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:54:10,206 INFO L225 Difference]: With dead ends: 207 [2022-03-17 16:54:10,206 INFO L226 Difference]: Without dead ends: 207 [2022-03-17 16:54:10,206 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-03-17 16:54:10,207 INFO L912 BasicCegarLoop]: 61 mSDtfsCounter, 119 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 16:54:10,207 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 264 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 16:54:10,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-03-17 16:54:10,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 199. [2022-03-17 16:54:10,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 126 states have (on average 1.1904761904761905) internal successors, (150), 130 states have internal predecessors, (150), 46 states have call successors, (46), 27 states have call predecessors, (46), 26 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-03-17 16:54:10,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 237 transitions. [2022-03-17 16:54:10,217 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 237 transitions. Word has length 60 [2022-03-17 16:54:10,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:54:10,218 INFO L478 AbstractCegarLoop]: Abstraction has 199 states and 237 transitions. [2022-03-17 16:54:10,218 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-03-17 16:54:10,218 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 237 transitions. [2022-03-17 16:54:10,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-03-17 16:54:10,219 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:54:10,219 INFO L500 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:54:10,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-17 16:54:10,435 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:54:10,435 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:54:10,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:54:10,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1491020248, now seen corresponding path program 1 times [2022-03-17 16:54:10,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:54:10,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577587222] [2022-03-17 16:54:10,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:54:10,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:54:10,448 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:54:10,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [81683567] [2022-03-17 16:54:10,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:54:10,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:54:10,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:54:10,453 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 16:54:10,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-17 16:54:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:54:10,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-17 16:54:10,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:54:10,613 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-03-17 16:54:10,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 16:54:10,741 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-03-17 16:54:10,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:54:10,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577587222] [2022-03-17 16:54:10,741 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:54:10,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81683567] [2022-03-17 16:54:10,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81683567] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 16:54:10,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-17 16:54:10,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-03-17 16:54:10,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063473549] [2022-03-17 16:54:10,743 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-17 16:54:10,743 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-17 16:54:10,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:54:10,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-17 16:54:10,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-03-17 16:54:10,744 INFO L87 Difference]: Start difference. First operand 199 states and 237 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-03-17 16:54:10,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:54:10,888 INFO L93 Difference]: Finished difference Result 263 states and 342 transitions. [2022-03-17 16:54:10,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-17 16:54:10,889 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 61 [2022-03-17 16:54:10,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:54:10,891 INFO L225 Difference]: With dead ends: 263 [2022-03-17 16:54:10,891 INFO L226 Difference]: Without dead ends: 263 [2022-03-17 16:54:10,891 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-03-17 16:54:10,892 INFO L912 BasicCegarLoop]: 70 mSDtfsCounter, 62 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 16:54:10,892 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 387 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 16:54:10,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-03-17 16:54:10,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 239. [2022-03-17 16:54:10,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 153 states have (on average 1.2222222222222223) internal successors, (187), 156 states have internal predecessors, (187), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-03-17 16:54:10,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 303 transitions. [2022-03-17 16:54:10,905 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 303 transitions. Word has length 61 [2022-03-17 16:54:10,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:54:10,905 INFO L478 AbstractCegarLoop]: Abstraction has 239 states and 303 transitions. [2022-03-17 16:54:10,905 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-03-17 16:54:10,905 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 303 transitions. [2022-03-17 16:54:10,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-03-17 16:54:10,906 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:54:10,906 INFO L500 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:54:10,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-17 16:54:11,129 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-17 16:54:11,130 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:54:11,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:54:11,130 INFO L85 PathProgramCache]: Analyzing trace with hash 317217743, now seen corresponding path program 1 times [2022-03-17 16:54:11,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:54:11,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158501278] [2022-03-17 16:54:11,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:54:11,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:54:11,139 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:54:11,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [330822215] [2022-03-17 16:54:11,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:54:11,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:54:11,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:54:11,141 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 16:54:11,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-17 16:54:11,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:54:11,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-17 16:54:11,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:54:11,297 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-03-17 16:54:11,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 16:54:11,416 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-03-17 16:54:11,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:54:11,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158501278] [2022-03-17 16:54:11,416 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:54:11,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330822215] [2022-03-17 16:54:11,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330822215] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 16:54:11,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-17 16:54:11,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-03-17 16:54:11,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212631465] [2022-03-17 16:54:11,417 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-17 16:54:11,417 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-17 16:54:11,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:54:11,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-17 16:54:11,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-03-17 16:54:11,418 INFO L87 Difference]: Start difference. First operand 239 states and 303 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-03-17 16:54:11,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:54:11,534 INFO L93 Difference]: Finished difference Result 252 states and 308 transitions. [2022-03-17 16:54:11,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-17 16:54:11,534 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) Word has length 63 [2022-03-17 16:54:11,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:54:11,536 INFO L225 Difference]: With dead ends: 252 [2022-03-17 16:54:11,536 INFO L226 Difference]: Without dead ends: 252 [2022-03-17 16:54:11,536 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-03-17 16:54:11,537 INFO L912 BasicCegarLoop]: 60 mSDtfsCounter, 83 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 16:54:11,537 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 266 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-17 16:54:11,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-03-17 16:54:11,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 248. [2022-03-17 16:54:11,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 162 states have (on average 1.1728395061728396) internal successors, (190), 165 states have internal predecessors, (190), 60 states have call successors, (60), 26 states have call predecessors, (60), 25 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2022-03-17 16:54:11,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 306 transitions. [2022-03-17 16:54:11,547 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 306 transitions. Word has length 63 [2022-03-17 16:54:11,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:54:11,547 INFO L478 AbstractCegarLoop]: Abstraction has 248 states and 306 transitions. [2022-03-17 16:54:11,547 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 6 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2022-03-17 16:54:11,547 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 306 transitions. [2022-03-17 16:54:11,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-03-17 16:54:11,548 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:54:11,548 INFO L500 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:54:11,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-17 16:54:11,763 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-03-17 16:54:11,763 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:54:11,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:54:11,764 INFO L85 PathProgramCache]: Analyzing trace with hash 918639692, now seen corresponding path program 1 times [2022-03-17 16:54:11,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:54:11,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468798811] [2022-03-17 16:54:11,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:54:11,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:54:11,774 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:54:11,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1043421132] [2022-03-17 16:54:11,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:54:11,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:54:11,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:54:11,776 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) [2022-03-17 16:54:11,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-17 16:54:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:54:11,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-17 16:54:11,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:54:12,100 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-03-17 16:54:12,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 16:54:12,261 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-03-17 16:54:12,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:54:12,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468798811] [2022-03-17 16:54:12,261 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:54:12,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043421132] [2022-03-17 16:54:12,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043421132] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 16:54:12,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-17 16:54:12,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-03-17 16:54:12,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993614342] [2022-03-17 16:54:12,262 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-17 16:54:12,262 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-17 16:54:12,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:54:12,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-17 16:54:12,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-03-17 16:54:12,263 INFO L87 Difference]: Start difference. First operand 248 states and 306 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-03-17 16:54:12,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:54:12,540 INFO L93 Difference]: Finished difference Result 332 states and 429 transitions. [2022-03-17 16:54:12,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-17 16:54:12,541 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) Word has length 68 [2022-03-17 16:54:12,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:54:12,544 INFO L225 Difference]: With dead ends: 332 [2022-03-17 16:54:12,544 INFO L226 Difference]: Without dead ends: 328 [2022-03-17 16:54:12,544 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-03-17 16:54:12,545 INFO L912 BasicCegarLoop]: 54 mSDtfsCounter, 44 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-17 16:54:12,545 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 395 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-17 16:54:12,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-03-17 16:54:12,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 295. [2022-03-17 16:54:12,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 195 states have (on average 1.1948717948717948) internal successors, (233), 204 states have internal predecessors, (233), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 61 states have call predecessors, (66), 66 states have call successors, (66) [2022-03-17 16:54:12,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 370 transitions. [2022-03-17 16:54:12,556 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 370 transitions. Word has length 68 [2022-03-17 16:54:12,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:54:12,556 INFO L478 AbstractCegarLoop]: Abstraction has 295 states and 370 transitions. [2022-03-17 16:54:12,556 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 6 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-03-17 16:54:12,557 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 370 transitions. [2022-03-17 16:54:12,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-03-17 16:54:12,557 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:54:12,557 INFO L500 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:54:12,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-17 16:54:12,780 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-17 16:54:12,780 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:54:12,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:54:12,781 INFO L85 PathProgramCache]: Analyzing trace with hash -210356579, now seen corresponding path program 2 times [2022-03-17 16:54:12,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:54:12,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92008726] [2022-03-17 16:54:12,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:54:12,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:54:12,789 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:54:12,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1884164234] [2022-03-17 16:54:12,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-17 16:54:12,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:54:12,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:54:12,791 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 16:54:12,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-17 16:54:12,841 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-17 16:54:12,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 16:54:12,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 36 conjunts are in the unsatisfiable core [2022-03-17 16:54:12,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:54:13,219 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-03-17 16:54:13,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 16:54:13,555 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-03-17 16:54:13,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:54:13,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92008726] [2022-03-17 16:54:13,555 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:54:13,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884164234] [2022-03-17 16:54:13,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884164234] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 16:54:13,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-17 16:54:13,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-03-17 16:54:13,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007398182] [2022-03-17 16:54:13,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-17 16:54:13,557 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-17 16:54:13,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:54:13,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-17 16:54:13,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-03-17 16:54:13,558 INFO L87 Difference]: Start difference. First operand 295 states and 370 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) [2022-03-17 16:54:15,832 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 16:54:15,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:54:15,849 INFO L93 Difference]: Finished difference Result 317 states and 395 transitions. [2022-03-17 16:54:15,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-17 16:54:15,850 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) Word has length 73 [2022-03-17 16:54:15,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:54:15,851 INFO L225 Difference]: With dead ends: 317 [2022-03-17 16:54:15,852 INFO L226 Difference]: Without dead ends: 316 [2022-03-17 16:54:15,852 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2022-03-17 16:54:15,852 INFO L912 BasicCegarLoop]: 42 mSDtfsCounter, 51 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-17 16:54:15,853 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 351 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-17 16:54:15,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-03-17 16:54:15,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 305. [2022-03-17 16:54:15,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 204 states have (on average 1.1862745098039216) internal successors, (242), 212 states have internal predecessors, (242), 69 states have call successors, (69), 32 states have call predecessors, (69), 31 states have return successors, (65), 60 states have call predecessors, (65), 65 states have call successors, (65) [2022-03-17 16:54:15,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 376 transitions. [2022-03-17 16:54:15,865 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 376 transitions. Word has length 73 [2022-03-17 16:54:15,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:54:15,865 INFO L478 AbstractCegarLoop]: Abstraction has 305 states and 376 transitions. [2022-03-17 16:54:15,865 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 9 states have call predecessors, (19), 9 states have call successors, (19) [2022-03-17 16:54:15,865 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 376 transitions. [2022-03-17 16:54:15,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-03-17 16:54:15,866 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:54:15,866 INFO L500 BasicCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:54:15,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-17 16:54:16,079 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-17 16:54:16,080 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:54:16,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:54:16,080 INFO L85 PathProgramCache]: Analyzing trace with hash 952478412, now seen corresponding path program 3 times [2022-03-17 16:54:16,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:54:16,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316692507] [2022-03-17 16:54:16,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:54:16,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:54:16,087 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:54:16,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [602043311] [2022-03-17 16:54:16,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-17 16:54:16,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:54:16,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:54:16,089 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 16:54:16,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-17 16:54:16,143 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-17 16:54:16,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 16:54:16,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 40 conjunts are in the unsatisfiable core [2022-03-17 16:54:16,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:54:16,673 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 31 proven. 10 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-03-17 16:54:16,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 16:54:16,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:54:16,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316692507] [2022-03-17 16:54:16,761 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:54:16,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602043311] [2022-03-17 16:54:16,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602043311] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 16:54:16,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-17 16:54:16,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-03-17 16:54:16,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674374156] [2022-03-17 16:54:16,762 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-17 16:54:16,762 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-17 16:54:16,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:54:16,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-17 16:54:16,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-03-17 16:54:16,763 INFO L87 Difference]: Start difference. First operand 305 states and 376 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-03-17 16:54:17,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:54:17,031 INFO L93 Difference]: Finished difference Result 335 states and 407 transitions. [2022-03-17 16:54:17,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-17 16:54:17,031 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 78 [2022-03-17 16:54:17,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:54:17,033 INFO L225 Difference]: With dead ends: 335 [2022-03-17 16:54:17,033 INFO L226 Difference]: Without dead ends: 333 [2022-03-17 16:54:17,033 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-03-17 16:54:17,034 INFO L912 BasicCegarLoop]: 42 mSDtfsCounter, 24 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-17 16:54:17,034 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 249 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-17 16:54:17,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-03-17 16:54:17,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 330. [2022-03-17 16:54:17,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 221 states have (on average 1.1764705882352942) internal successors, (260), 228 states have internal predecessors, (260), 73 states have call successors, (73), 37 states have call predecessors, (73), 35 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) [2022-03-17 16:54:17,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 402 transitions. [2022-03-17 16:54:17,044 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 402 transitions. Word has length 78 [2022-03-17 16:54:17,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:54:17,044 INFO L478 AbstractCegarLoop]: Abstraction has 330 states and 402 transitions. [2022-03-17 16:54:17,044 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-03-17 16:54:17,044 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 402 transitions. [2022-03-17 16:54:17,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-03-17 16:54:17,045 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:54:17,045 INFO L500 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:54:17,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-17 16:54:17,271 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:54:17,271 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:54:17,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:54:17,272 INFO L85 PathProgramCache]: Analyzing trace with hash 900405455, now seen corresponding path program 1 times [2022-03-17 16:54:17,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:54:17,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333306828] [2022-03-17 16:54:17,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:54:17,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:54:17,279 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:54:17,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [844851044] [2022-03-17 16:54:17,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:54:17,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:54:17,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:54:17,280 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 16:54:17,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-17 16:54:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:54:17,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 42 conjunts are in the unsatisfiable core [2022-03-17 16:54:17,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:54:17,866 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 30 proven. 17 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-03-17 16:54:17,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 16:54:18,368 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 30 proven. 17 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-03-17 16:54:18,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:54:18,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333306828] [2022-03-17 16:54:18,369 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:54:18,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844851044] [2022-03-17 16:54:18,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844851044] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 16:54:18,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-17 16:54:18,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2022-03-17 16:54:18,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599707747] [2022-03-17 16:54:18,370 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-17 16:54:18,370 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-17 16:54:18,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:54:18,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-17 16:54:18,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2022-03-17 16:54:18,371 INFO L87 Difference]: Start difference. First operand 330 states and 402 transitions. Second operand has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-03-17 16:54:21,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:54:21,108 INFO L93 Difference]: Finished difference Result 390 states and 484 transitions. [2022-03-17 16:54:21,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-17 16:54:21,108 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) Word has length 84 [2022-03-17 16:54:21,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:54:21,110 INFO L225 Difference]: With dead ends: 390 [2022-03-17 16:54:21,110 INFO L226 Difference]: Without dead ends: 377 [2022-03-17 16:54:21,111 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=248, Invalid=1084, Unknown=0, NotChecked=0, Total=1332 [2022-03-17 16:54:21,111 INFO L912 BasicCegarLoop]: 50 mSDtfsCounter, 87 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-17 16:54:21,112 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 521 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-17 16:54:21,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-03-17 16:54:21,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 368. [2022-03-17 16:54:21,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 247 states have (on average 1.1902834008097165) internal successors, (294), 252 states have internal predecessors, (294), 84 states have call successors, (84), 37 states have call predecessors, (84), 36 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2022-03-17 16:54:21,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 460 transitions. [2022-03-17 16:54:21,126 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 460 transitions. Word has length 84 [2022-03-17 16:54:21,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:54:21,126 INFO L478 AbstractCegarLoop]: Abstraction has 368 states and 460 transitions. [2022-03-17 16:54:21,127 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2022-03-17 16:54:21,127 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 460 transitions. [2022-03-17 16:54:21,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-03-17 16:54:21,128 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:54:21,128 INFO L500 BasicCegarLoop]: trace histogram [12, 11, 11, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:54:21,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-17 16:54:21,351 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-17 16:54:21,351 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:54:21,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:54:21,352 INFO L85 PathProgramCache]: Analyzing trace with hash 653404933, now seen corresponding path program 1 times [2022-03-17 16:54:21,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:54:21,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409710428] [2022-03-17 16:54:21,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:54:21,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:54:21,360 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:54:21,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2105724318] [2022-03-17 16:54:21,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:54:21,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:54:21,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:54:21,362 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 16:54:21,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-17 16:54:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:54:21,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-17 16:54:21,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:54:22,259 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 51 proven. 23 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2022-03-17 16:54:22,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 16:54:22,605 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 16:54:23,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:54:23,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409710428] [2022-03-17 16:54:23,902 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:54:23,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105724318] [2022-03-17 16:54:23,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105724318] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 16:54:23,902 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-17 16:54:23,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-03-17 16:54:23,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471078350] [2022-03-17 16:54:23,903 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-17 16:54:23,903 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-17 16:54:23,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:54:23,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-17 16:54:23,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-03-17 16:54:23,904 INFO L87 Difference]: Start difference. First operand 368 states and 460 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-03-17 16:54:24,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:54:24,492 INFO L93 Difference]: Finished difference Result 375 states and 465 transitions. [2022-03-17 16:54:24,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-17 16:54:24,493 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) Word has length 101 [2022-03-17 16:54:24,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:54:24,494 INFO L225 Difference]: With dead ends: 375 [2022-03-17 16:54:24,495 INFO L226 Difference]: Without dead ends: 375 [2022-03-17 16:54:24,495 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-03-17 16:54:24,495 INFO L912 BasicCegarLoop]: 53 mSDtfsCounter, 33 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-17 16:54:24,496 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 361 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-17 16:54:24,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-03-17 16:54:24,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 372. [2022-03-17 16:54:24,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 250 states have (on average 1.184) internal successors, (296), 255 states have internal predecessors, (296), 84 states have call successors, (84), 38 states have call predecessors, (84), 37 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2022-03-17 16:54:24,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 462 transitions. [2022-03-17 16:54:24,505 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 462 transitions. Word has length 101 [2022-03-17 16:54:24,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:54:24,506 INFO L478 AbstractCegarLoop]: Abstraction has 372 states and 462 transitions. [2022-03-17 16:54:24,506 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-03-17 16:54:24,506 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 462 transitions. [2022-03-17 16:54:24,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-17 16:54:24,507 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:54:24,507 INFO L500 BasicCegarLoop]: trace histogram [12, 11, 11, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:54:24,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-17 16:54:24,730 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-17 16:54:24,730 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:54:24,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:54:24,731 INFO L85 PathProgramCache]: Analyzing trace with hash 487608439, now seen corresponding path program 4 times [2022-03-17 16:54:24,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:54:24,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369036100] [2022-03-17 16:54:24,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:54:24,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:54:24,739 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:54:24,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1965848256] [2022-03-17 16:54:24,739 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-17 16:54:24,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:54:24,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:54:24,741 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 16:54:24,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-17 16:54:24,790 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-17 16:54:24,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 16:54:24,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-17 16:54:24,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:54:24,921 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-03-17 16:54:24,921 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-17 16:54:24,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:54:24,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369036100] [2022-03-17 16:54:24,921 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:54:24,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965848256] [2022-03-17 16:54:24,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965848256] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 16:54:24,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 16:54:24,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-17 16:54:24,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857366011] [2022-03-17 16:54:24,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 16:54:24,922 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-17 16:54:24,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:54:24,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-17 16:54:24,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-17 16:54:24,922 INFO L87 Difference]: Start difference. First operand 372 states and 462 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-03-17 16:54:24,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:54:24,967 INFO L93 Difference]: Finished difference Result 417 states and 535 transitions. [2022-03-17 16:54:24,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-17 16:54:24,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 105 [2022-03-17 16:54:24,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:54:24,973 INFO L225 Difference]: With dead ends: 417 [2022-03-17 16:54:24,974 INFO L226 Difference]: Without dead ends: 417 [2022-03-17 16:54:24,974 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-03-17 16:54:24,974 INFO L912 BasicCegarLoop]: 60 mSDtfsCounter, 12 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 16:54:24,975 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 194 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-17 16:54:24,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2022-03-17 16:54:24,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 387. [2022-03-17 16:54:24,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 259 states have (on average 1.193050193050193) internal successors, (309), 263 states have internal predecessors, (309), 90 states have call successors, (90), 38 states have call predecessors, (90), 37 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) [2022-03-17 16:54:24,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 487 transitions. [2022-03-17 16:54:24,992 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 487 transitions. Word has length 105 [2022-03-17 16:54:24,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:54:24,993 INFO L478 AbstractCegarLoop]: Abstraction has 387 states and 487 transitions. [2022-03-17 16:54:24,993 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-03-17 16:54:24,993 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 487 transitions. [2022-03-17 16:54:24,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-03-17 16:54:24,995 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:54:24,995 INFO L500 BasicCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:54:25,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-17 16:54:25,218 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-17 16:54:25,219 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:54:25,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:54:25,220 INFO L85 PathProgramCache]: Analyzing trace with hash 791718745, now seen corresponding path program 1 times [2022-03-17 16:54:25,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:54:25,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386836274] [2022-03-17 16:54:25,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:54:25,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:54:25,228 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:54:25,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1805047052] [2022-03-17 16:54:25,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:54:25,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:54:25,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:54:25,236 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 16:54:25,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-17 16:54:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 16:54:25,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-17 16:54:25,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:54:25,499 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 32 proven. 229 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-03-17 16:54:25,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 16:54:25,716 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 32 proven. 37 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-03-17 16:54:25,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:54:25,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386836274] [2022-03-17 16:54:25,716 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:54:25,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805047052] [2022-03-17 16:54:25,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805047052] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 16:54:25,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-17 16:54:25,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-03-17 16:54:25,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663728957] [2022-03-17 16:54:25,717 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-17 16:54:25,717 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-17 16:54:25,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:54:25,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-17 16:54:25,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-03-17 16:54:25,718 INFO L87 Difference]: Start difference. First operand 387 states and 487 transitions. Second operand has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 10 states have call successors, (36), 7 states have call predecessors, (36), 6 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) [2022-03-17 16:54:26,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 16:54:26,130 INFO L93 Difference]: Finished difference Result 1260 states and 1555 transitions. [2022-03-17 16:54:26,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-17 16:54:26,130 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 10 states have call successors, (36), 7 states have call predecessors, (36), 6 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) Word has length 116 [2022-03-17 16:54:26,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 16:54:26,135 INFO L225 Difference]: With dead ends: 1260 [2022-03-17 16:54:26,135 INFO L226 Difference]: Without dead ends: 1260 [2022-03-17 16:54:26,135 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=311, Invalid=559, Unknown=0, NotChecked=0, Total=870 [2022-03-17 16:54:26,136 INFO L912 BasicCegarLoop]: 90 mSDtfsCounter, 296 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-17 16:54:26,136 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 458 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-17 16:54:26,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2022-03-17 16:54:26,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1202. [2022-03-17 16:54:26,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 771 states have (on average 1.1595330739299612) internal successors, (894), 782 states have internal predecessors, (894), 305 states have call successors, (305), 126 states have call predecessors, (305), 125 states have return successors, (296), 293 states have call predecessors, (296), 296 states have call successors, (296) [2022-03-17 16:54:26,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1495 transitions. [2022-03-17 16:54:26,163 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1495 transitions. Word has length 116 [2022-03-17 16:54:26,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 16:54:26,163 INFO L478 AbstractCegarLoop]: Abstraction has 1202 states and 1495 transitions. [2022-03-17 16:54:26,164 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 10 states have call successors, (36), 7 states have call predecessors, (36), 6 states have return successors, (34), 8 states have call predecessors, (34), 9 states have call successors, (34) [2022-03-17 16:54:26,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1495 transitions. [2022-03-17 16:54:26,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-17 16:54:26,165 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 16:54:26,165 INFO L500 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 16:54:26,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-17 16:54:26,379 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-17 16:54:26,379 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 16:54:26,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 16:54:26,380 INFO L85 PathProgramCache]: Analyzing trace with hash -351372628, now seen corresponding path program 2 times [2022-03-17 16:54:26,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 16:54:26,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325746028] [2022-03-17 16:54:26,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 16:54:26,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 16:54:26,387 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 16:54:26,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1058077123] [2022-03-17 16:54:26,388 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-17 16:54:26,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 16:54:26,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 16:54:26,389 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 16:54:26,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-17 16:54:26,470 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-17 16:54:26,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 16:54:26,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 73 conjunts are in the unsatisfiable core [2022-03-17 16:54:26,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 16:54:29,926 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 16:54:32,128 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 139 proven. 92 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2022-03-17 16:54:32,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 16:54:35,124 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 16:54:47,269 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-17 16:54:55,780 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 136 proven. 86 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2022-03-17 16:54:55,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 16:54:55,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325746028] [2022-03-17 16:54:55,781 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 16:54:55,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058077123] [2022-03-17 16:54:55,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058077123] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 16:54:55,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-17 16:54:55,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 29 [2022-03-17 16:54:55,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311033183] [2022-03-17 16:54:55,781 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-17 16:54:55,782 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-17 16:54:55,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 16:54:55,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-17 16:54:55,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=637, Unknown=4, NotChecked=0, Total=812 [2022-03-17 16:54:55,783 INFO L87 Difference]: Start difference. First operand 1202 states and 1495 transitions. Second operand has 29 states, 26 states have (on average 2.230769230769231) internal successors, (58), 20 states have internal predecessors, (58), 17 states have call successors, (40), 2 states have call predecessors, (40), 3 states have return successors, (38), 15 states have call predecessors, (38), 16 states have call successors, (38) [2022-03-17 16:55:00,858 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 16:55:03,023 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 16:55:13,060 WARN L232 SmtUtils]: Spent 6.44s on a formula simplification. DAG size of input: 127 DAG size of output: 126 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 16:55:25,975 WARN L232 SmtUtils]: Spent 10.20s on a formula simplification. DAG size of input: 86 DAG size of output: 85 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 16:55:27,980 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 16:55:30,130 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 16:55:33,253 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 16:55:35,392 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 16:55:37,395 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 16:55:48,506 WARN L232 SmtUtils]: Spent 9.48s on a formula simplification. DAG size of input: 80 DAG size of output: 79 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 16:56:43,095 WARN L232 SmtUtils]: Spent 51.09s on a formula simplification. DAG size of input: 109 DAG size of output: 108 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 16:56:54,846 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 16:56:56,856 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 16:56:58,860 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 16:57:04,930 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 16:57:06,956 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 16:57:12,776 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 16:57:21,431 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 16:57:35,079 WARN L232 SmtUtils]: Spent 6.65s on a formula simplification. DAG size of input: 52 DAG size of output: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 16:57:38,639 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 16:57:40,643 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 16:57:42,646 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 16:57:50,871 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 16:57:56,774 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 16:58:33,011 WARN L232 SmtUtils]: Spent 34.50s on a formula simplification. DAG size of input: 147 DAG size of output: 127 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 16:58:38,739 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 16:58:46,587 WARN L232 SmtUtils]: Spent 5.25s on a formula simplification. DAG size of input: 128 DAG size of output: 127 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 16:58:57,297 WARN L232 SmtUtils]: Spent 6.63s on a formula simplification. DAG size of input: 87 DAG size of output: 86 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 16:58:59,485 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 16:59:44,944 WARN L232 SmtUtils]: Spent 35.72s on a formula simplification. DAG size of input: 110 DAG size of output: 90 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 16:59:46,952 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 16:59:48,964 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 16:59:50,969 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 17:00:05,787 WARN L232 SmtUtils]: Spent 9.97s on a formula simplification. DAG size of input: 146 DAG size of output: 127 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 17:00:08,779 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 17:00:10,783 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 17:00:12,785 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 17:00:14,790 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 17:00:18,187 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 17:00:20,191 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 17:00:22,195 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 17:00:24,200 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 17:00:26,329 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 17:00:28,333 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 17:00:28,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 17:00:28,335 INFO L93 Difference]: Finished difference Result 1623 states and 2100 transitions. [2022-03-17 17:00:28,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-17 17:00:28,337 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 2.230769230769231) internal successors, (58), 20 states have internal predecessors, (58), 17 states have call successors, (40), 2 states have call predecessors, (40), 3 states have return successors, (38), 15 states have call predecessors, (38), 16 states have call successors, (38) Word has length 124 [2022-03-17 17:00:28,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 17:00:28,343 INFO L225 Difference]: With dead ends: 1623 [2022-03-17 17:00:28,343 INFO L226 Difference]: Without dead ends: 1623 [2022-03-17 17:00:28,344 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 218 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 704 ImplicationChecksByTransitivity, 267.1s TimeCoverageRelationStatistics Valid=610, Invalid=2025, Unknown=17, NotChecked=0, Total=2652 [2022-03-17 17:00:28,345 INFO L912 BasicCegarLoop]: 52 mSDtfsCounter, 253 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 344 mSolverCounterUnsat, 31 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 86.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 1242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 344 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 31 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 86.9s IncrementalHoareTripleChecker+Time [2022-03-17 17:00:28,345 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [262 Valid, 653 Invalid, 1242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [344 Valid, 867 Invalid, 31 Unknown, 0 Unchecked, 86.9s Time] [2022-03-17 17:00:28,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2022-03-17 17:00:28,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1545. [2022-03-17 17:00:28,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 972 states have (on average 1.1779835390946503) internal successors, (1145), 988 states have internal predecessors, (1145), 430 states have call successors, (430), 143 states have call predecessors, (430), 142 states have return successors, (421), 413 states have call predecessors, (421), 421 states have call successors, (421) [2022-03-17 17:00:28,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 1996 transitions. [2022-03-17 17:00:28,384 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 1996 transitions. Word has length 124 [2022-03-17 17:00:28,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 17:00:28,385 INFO L478 AbstractCegarLoop]: Abstraction has 1545 states and 1996 transitions. [2022-03-17 17:00:28,385 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 2.230769230769231) internal successors, (58), 20 states have internal predecessors, (58), 17 states have call successors, (40), 2 states have call predecessors, (40), 3 states have return successors, (38), 15 states have call predecessors, (38), 16 states have call successors, (38) [2022-03-17 17:00:28,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1996 transitions. [2022-03-17 17:00:28,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-03-17 17:00:28,386 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 17:00:28,386 INFO L500 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 17:00:28,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-17 17:00:28,599 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 17:00:28,599 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 17:00:28,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 17:00:28,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1703433466, now seen corresponding path program 3 times [2022-03-17 17:00:28,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 17:00:28,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198494613] [2022-03-17 17:00:28,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 17:00:28,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 17:00:28,608 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 17:00:28,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [148009813] [2022-03-17 17:00:28,608 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-17 17:00:28,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 17:00:28,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 17:00:28,609 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 17:00:28,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-17 17:00:28,696 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-17 17:00:28,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 17:00:28,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 67 conjunts are in the unsatisfiable core [2022-03-17 17:00:28,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 17:00:29,798 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 100 proven. 57 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2022-03-17 17:00:29,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 17:00:47,544 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 101 proven. 56 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2022-03-17 17:00:47,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 17:00:47,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198494613] [2022-03-17 17:00:47,544 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 17:00:47,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148009813] [2022-03-17 17:00:47,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148009813] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 17:00:47,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-17 17:00:47,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2022-03-17 17:00:47,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937289142] [2022-03-17 17:00:47,545 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-17 17:00:47,545 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-17 17:00:47,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 17:00:47,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-17 17:00:47,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=356, Unknown=1, NotChecked=0, Total=462 [2022-03-17 17:00:47,546 INFO L87 Difference]: Start difference. First operand 1545 states and 1996 transitions. Second operand has 22 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 12 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 14 states have call predecessors, (37), 11 states have call successors, (37) [2022-03-17 17:00:49,250 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 17:00:52,366 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 17:01:08,181 WARN L232 SmtUtils]: Spent 13.78s on a formula simplification that was a NOOP. DAG size: 136 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 17:01:13,045 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 17:01:18,225 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 17:01:20,229 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 17:01:24,354 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 17:01:33,284 WARN L232 SmtUtils]: Spent 8.85s on a formula simplification that was a NOOP. DAG size: 113 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 17:01:35,913 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 17:01:37,917 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 17:01:39,922 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 17:01:42,716 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 17:01:45,558 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 17:01:47,646 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 17:01:49,652 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 17:01:51,807 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 17:01:53,822 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 17:01:56,052 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 17:01:58,395 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 17:02:01,112 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 17:02:03,125 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 17:02:05,302 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 17:02:12,100 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 17:02:14,102 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 17:02:16,105 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-17 17:02:16,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 17:02:16,409 INFO L93 Difference]: Finished difference Result 1883 states and 2462 transitions. [2022-03-17 17:02:16,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-17 17:02:16,410 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 12 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 14 states have call predecessors, (37), 11 states have call successors, (37) Word has length 128 [2022-03-17 17:02:16,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 17:02:16,416 INFO L225 Difference]: With dead ends: 1883 [2022-03-17 17:02:16,416 INFO L226 Difference]: Without dead ends: 1869 [2022-03-17 17:02:16,416 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 233 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 41.0s TimeCoverageRelationStatistics Valid=352, Invalid=979, Unknown=1, NotChecked=0, Total=1332 [2022-03-17 17:02:16,417 INFO L912 BasicCegarLoop]: 60 mSDtfsCounter, 144 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 168 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 55.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 55.6s IncrementalHoareTripleChecker+Time [2022-03-17 17:02:16,417 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 819 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 806 Invalid, 21 Unknown, 0 Unchecked, 55.6s Time] [2022-03-17 17:02:16,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2022-03-17 17:02:16,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 1756. [2022-03-17 17:02:16,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1118 states have (on average 1.1914132379248659) internal successors, (1332), 1130 states have internal predecessors, (1332), 482 states have call successors, (482), 157 states have call predecessors, (482), 155 states have return successors, (479), 468 states have call predecessors, (479), 479 states have call successors, (479) [2022-03-17 17:02:16,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 2293 transitions. [2022-03-17 17:02:16,462 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 2293 transitions. Word has length 128 [2022-03-17 17:02:16,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 17:02:16,462 INFO L478 AbstractCegarLoop]: Abstraction has 1756 states and 2293 transitions. [2022-03-17 17:02:16,463 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 12 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 14 states have call predecessors, (37), 11 states have call successors, (37) [2022-03-17 17:02:16,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2293 transitions. [2022-03-17 17:02:16,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-03-17 17:02:16,464 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 17:02:16,464 INFO L500 BasicCegarLoop]: trace histogram [17, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 17:02:16,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-03-17 17:02:16,678 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 17:02:16,679 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 17:02:16,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 17:02:16,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1569660177, now seen corresponding path program 1 times [2022-03-17 17:02:16,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 17:02:16,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972493072] [2022-03-17 17:02:16,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 17:02:16,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 17:02:16,686 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 17:02:16,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [546390555] [2022-03-17 17:02:16,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 17:02:16,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 17:02:16,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 17:02:16,688 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 17:02:16,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-17 17:02:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 17:02:16,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-17 17:02:16,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 17:02:16,998 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 32 proven. 434 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-03-17 17:02:16,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 17:02:17,251 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 32 proven. 50 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2022-03-17 17:02:17,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 17:02:17,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972493072] [2022-03-17 17:02:17,252 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 17:02:17,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546390555] [2022-03-17 17:02:17,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546390555] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 17:02:17,252 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-17 17:02:17,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-03-17 17:02:17,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011575468] [2022-03-17 17:02:17,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-17 17:02:17,252 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-17 17:02:17,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 17:02:17,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-17 17:02:17,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-03-17 17:02:17,253 INFO L87 Difference]: Start difference. First operand 1756 states and 2293 transitions. Second operand has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 12 states have call successors, (44), 8 states have call predecessors, (44), 7 states have return successors, (42), 10 states have call predecessors, (42), 11 states have call successors, (42) [2022-03-17 17:02:17,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 17:02:17,646 INFO L93 Difference]: Finished difference Result 1809 states and 2308 transitions. [2022-03-17 17:02:17,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-17 17:02:17,646 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 12 states have call successors, (44), 8 states have call predecessors, (44), 7 states have return successors, (42), 10 states have call predecessors, (42), 11 states have call successors, (42) Word has length 133 [2022-03-17 17:02:17,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 17:02:17,653 INFO L225 Difference]: With dead ends: 1809 [2022-03-17 17:02:17,653 INFO L226 Difference]: Without dead ends: 1809 [2022-03-17 17:02:17,653 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=312, Invalid=558, Unknown=0, NotChecked=0, Total=870 [2022-03-17 17:02:17,654 INFO L912 BasicCegarLoop]: 88 mSDtfsCounter, 233 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-17 17:02:17,654 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 449 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-17 17:02:17,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-03-17 17:02:17,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1777. [2022-03-17 17:02:17,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1777 states, 1139 states have (on average 1.160667251975417) internal successors, (1322), 1151 states have internal predecessors, (1322), 482 states have call successors, (482), 157 states have call predecessors, (482), 155 states have return successors, (479), 468 states have call predecessors, (479), 479 states have call successors, (479) [2022-03-17 17:02:17,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1777 states and 2283 transitions. [2022-03-17 17:02:17,692 INFO L78 Accepts]: Start accepts. Automaton has 1777 states and 2283 transitions. Word has length 133 [2022-03-17 17:02:17,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 17:02:17,693 INFO L478 AbstractCegarLoop]: Abstraction has 1777 states and 2283 transitions. [2022-03-17 17:02:17,693 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 18 states have internal predecessors, (76), 12 states have call successors, (44), 8 states have call predecessors, (44), 7 states have return successors, (42), 10 states have call predecessors, (42), 11 states have call successors, (42) [2022-03-17 17:02:17,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2283 transitions. [2022-03-17 17:02:17,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-03-17 17:02:17,695 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 17:02:17,695 INFO L500 BasicCegarLoop]: trace histogram [17, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-03-17 17:02:17,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-17 17:02:17,911 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 17:02:17,911 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 17:02:17,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 17:02:17,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1381701507, now seen corresponding path program 2 times [2022-03-17 17:02:17,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 17:02:17,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017052125] [2022-03-17 17:02:17,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 17:02:17,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 17:02:17,919 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 17:02:17,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [642974554] [2022-03-17 17:02:17,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-17 17:02:17,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 17:02:17,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 17:02:17,920 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 17:02:17,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-17 17:02:17,983 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-17 17:02:17,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 17:02:17,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 90 conjunts are in the unsatisfiable core [2022-03-17 17:02:17,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 17:02:19,930 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 123 proven. 126 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2022-03-17 17:02:19,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 17:02:21,207 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 156 proven. 12 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-03-17 17:02:21,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 17:02:21,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017052125] [2022-03-17 17:02:21,208 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 17:02:21,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642974554] [2022-03-17 17:02:21,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642974554] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 17:02:21,208 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-17 17:02:21,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 26 [2022-03-17 17:02:21,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073807879] [2022-03-17 17:02:21,208 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-17 17:02:21,209 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-17 17:02:21,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 17:02:21,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-17 17:02:21,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2022-03-17 17:02:21,209 INFO L87 Difference]: Start difference. First operand 1777 states and 2283 transitions. Second operand has 26 states, 21 states have (on average 2.619047619047619) internal successors, (55), 19 states have internal predecessors, (55), 14 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 11 states have call predecessors, (31), 12 states have call successors, (31) [2022-03-17 17:02:27,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 17:02:27,162 INFO L93 Difference]: Finished difference Result 1897 states and 2418 transitions. [2022-03-17 17:02:27,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-17 17:02:27,163 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 21 states have (on average 2.619047619047619) internal successors, (55), 19 states have internal predecessors, (55), 14 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 11 states have call predecessors, (31), 12 states have call successors, (31) Word has length 134 [2022-03-17 17:02:27,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 17:02:27,169 INFO L225 Difference]: With dead ends: 1897 [2022-03-17 17:02:27,169 INFO L226 Difference]: Without dead ends: 1888 [2022-03-17 17:02:27,170 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 243 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=323, Invalid=1399, Unknown=0, NotChecked=0, Total=1722 [2022-03-17 17:02:27,170 INFO L912 BasicCegarLoop]: 65 mSDtfsCounter, 96 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-17 17:02:27,171 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 714 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-03-17 17:02:27,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2022-03-17 17:02:27,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 1729. [2022-03-17 17:02:27,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1729 states, 1098 states have (on average 1.138433515482696) internal successors, (1250), 1113 states have internal predecessors, (1250), 461 states have call successors, (461), 170 states have call predecessors, (461), 169 states have return successors, (459), 445 states have call predecessors, (459), 459 states have call successors, (459) [2022-03-17 17:02:27,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1729 states and 2170 transitions. [2022-03-17 17:02:27,209 INFO L78 Accepts]: Start accepts. Automaton has 1729 states and 2170 transitions. Word has length 134 [2022-03-17 17:02:27,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 17:02:27,209 INFO L478 AbstractCegarLoop]: Abstraction has 1729 states and 2170 transitions. [2022-03-17 17:02:27,209 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 21 states have (on average 2.619047619047619) internal successors, (55), 19 states have internal predecessors, (55), 14 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (31), 11 states have call predecessors, (31), 12 states have call successors, (31) [2022-03-17 17:02:27,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 2170 transitions. [2022-03-17 17:02:27,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2022-03-17 17:02:27,214 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 17:02:27,214 INFO L500 BasicCegarLoop]: trace histogram [37, 36, 36, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 17:02:27,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-03-17 17:02:27,435 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 17:02:27,435 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 17:02:27,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 17:02:27,436 INFO L85 PathProgramCache]: Analyzing trace with hash -42185316, now seen corresponding path program 2 times [2022-03-17 17:02:27,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 17:02:27,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078320680] [2022-03-17 17:02:27,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 17:02:27,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 17:02:27,444 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 17:02:27,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [483500317] [2022-03-17 17:02:27,444 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-17 17:02:27,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 17:02:27,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 17:02:27,445 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 17:02:27,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-17 17:02:27,548 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-17 17:02:27,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 17:02:27,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-17 17:02:27,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 17:02:28,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2918 backedges. 72 proven. 2606 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-03-17 17:02:28,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 17:02:28,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2918 backedges. 72 proven. 302 refuted. 0 times theorem prover too weak. 2544 trivial. 0 not checked. [2022-03-17 17:02:28,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 17:02:28,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078320680] [2022-03-17 17:02:28,673 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 17:02:28,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483500317] [2022-03-17 17:02:28,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483500317] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 17:02:28,673 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-17 17:02:28,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-03-17 17:02:28,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162551237] [2022-03-17 17:02:28,674 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-17 17:02:28,674 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-17 17:02:28,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 17:02:28,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-17 17:02:28,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2022-03-17 17:02:28,675 INFO L87 Difference]: Start difference. First operand 1729 states and 2170 transitions. Second operand has 34 states, 34 states have (on average 4.264705882352941) internal successors, (145), 34 states have internal predecessors, (145), 22 states have call successors, (84), 13 states have call predecessors, (84), 12 states have return successors, (82), 20 states have call predecessors, (82), 21 states have call successors, (82) [2022-03-17 17:02:29,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 17:02:29,757 INFO L93 Difference]: Finished difference Result 6927 states and 9405 transitions. [2022-03-17 17:02:29,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-03-17 17:02:29,757 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 4.264705882352941) internal successors, (145), 34 states have internal predecessors, (145), 22 states have call successors, (84), 13 states have call predecessors, (84), 12 states have return successors, (82), 20 states have call predecessors, (82), 21 states have call successors, (82) Word has length 260 [2022-03-17 17:02:29,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 17:02:29,785 INFO L225 Difference]: With dead ends: 6927 [2022-03-17 17:02:29,785 INFO L226 Difference]: Without dead ends: 6925 [2022-03-17 17:02:29,786 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 487 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1384, Invalid=2398, Unknown=0, NotChecked=0, Total=3782 [2022-03-17 17:02:29,787 INFO L912 BasicCegarLoop]: 152 mSDtfsCounter, 877 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 786 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 786 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-17 17:02:29,787 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [877 Valid, 633 Invalid, 1389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [786 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-17 17:02:29,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6925 states. [2022-03-17 17:02:29,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6925 to 6797. [2022-03-17 17:02:29,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6797 states, 4391 states have (on average 1.223183785014803) internal successors, (5371), 4532 states have internal predecessors, (5371), 1967 states have call successors, (1967), 440 states have call predecessors, (1967), 438 states have return successors, (1951), 1824 states have call predecessors, (1951), 1951 states have call successors, (1951) [2022-03-17 17:02:29,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6797 states to 6797 states and 9289 transitions. [2022-03-17 17:02:29,974 INFO L78 Accepts]: Start accepts. Automaton has 6797 states and 9289 transitions. Word has length 260 [2022-03-17 17:02:29,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 17:02:29,974 INFO L478 AbstractCegarLoop]: Abstraction has 6797 states and 9289 transitions. [2022-03-17 17:02:29,975 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.264705882352941) internal successors, (145), 34 states have internal predecessors, (145), 22 states have call successors, (84), 13 states have call predecessors, (84), 12 states have return successors, (82), 20 states have call predecessors, (82), 21 states have call successors, (82) [2022-03-17 17:02:29,975 INFO L276 IsEmpty]: Start isEmpty. Operand 6797 states and 9289 transitions. [2022-03-17 17:02:29,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-03-17 17:02:29,981 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 17:02:29,981 INFO L500 BasicCegarLoop]: trace histogram [37, 36, 36, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 17:02:30,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-03-17 17:02:30,201 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 17:02:30,201 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 17:02:30,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 17:02:30,201 INFO L85 PathProgramCache]: Analyzing trace with hash 2118395671, now seen corresponding path program 1 times [2022-03-17 17:02:30,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 17:02:30,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403831741] [2022-03-17 17:02:30,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 17:02:30,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 17:02:30,212 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 17:02:30,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1673667108] [2022-03-17 17:02:30,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 17:02:30,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 17:02:30,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 17:02:30,223 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 17:02:30,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-03-17 17:02:30,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 17:02:30,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-17 17:02:30,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 17:02:30,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 91 proven. 2610 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-03-17 17:02:30,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 17:02:31,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 91 proven. 306 refuted. 0 times theorem prover too weak. 2544 trivial. 0 not checked. [2022-03-17 17:02:31,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 17:02:31,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403831741] [2022-03-17 17:02:31,423 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 17:02:31,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673667108] [2022-03-17 17:02:31,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673667108] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 17:02:31,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-17 17:02:31,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-03-17 17:02:31,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695595766] [2022-03-17 17:02:31,424 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-17 17:02:31,424 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-17 17:02:31,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 17:02:31,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-17 17:02:31,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2022-03-17 17:02:31,425 INFO L87 Difference]: Start difference. First operand 6797 states and 9289 transitions. Second operand has 34 states, 34 states have (on average 4.323529411764706) internal successors, (147), 34 states have internal predecessors, (147), 22 states have call successors, (84), 13 states have call predecessors, (84), 12 states have return successors, (82), 20 states have call predecessors, (82), 21 states have call successors, (82) [2022-03-17 17:02:32,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 17:02:32,489 INFO L93 Difference]: Finished difference Result 4561 states and 5658 transitions. [2022-03-17 17:02:32,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-03-17 17:02:32,490 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 4.323529411764706) internal successors, (147), 34 states have internal predecessors, (147), 22 states have call successors, (84), 13 states have call predecessors, (84), 12 states have return successors, (82), 20 states have call predecessors, (82), 21 states have call successors, (82) Word has length 263 [2022-03-17 17:02:32,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 17:02:32,506 INFO L225 Difference]: With dead ends: 4561 [2022-03-17 17:02:32,506 INFO L226 Difference]: Without dead ends: 4561 [2022-03-17 17:02:32,507 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1383, Invalid=2399, Unknown=0, NotChecked=0, Total=3782 [2022-03-17 17:02:32,507 INFO L912 BasicCegarLoop]: 152 mSDtfsCounter, 869 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 833 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 833 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-17 17:02:32,508 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [869 Valid, 724 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [833 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-17 17:02:32,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4561 states. [2022-03-17 17:02:32,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4561 to 4273. [2022-03-17 17:02:32,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4273 states, 2618 states have (on average 1.1130634071810543) internal successors, (2914), 2649 states have internal predecessors, (2914), 1229 states have call successors, (1229), 426 states have call predecessors, (1229), 425 states have return successors, (1227), 1197 states have call predecessors, (1227), 1227 states have call successors, (1227) [2022-03-17 17:02:32,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4273 states to 4273 states and 5370 transitions. [2022-03-17 17:02:32,584 INFO L78 Accepts]: Start accepts. Automaton has 4273 states and 5370 transitions. Word has length 263 [2022-03-17 17:02:32,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 17:02:32,584 INFO L478 AbstractCegarLoop]: Abstraction has 4273 states and 5370 transitions. [2022-03-17 17:02:32,584 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.323529411764706) internal successors, (147), 34 states have internal predecessors, (147), 22 states have call successors, (84), 13 states have call predecessors, (84), 12 states have return successors, (82), 20 states have call predecessors, (82), 21 states have call successors, (82) [2022-03-17 17:02:32,584 INFO L276 IsEmpty]: Start isEmpty. Operand 4273 states and 5370 transitions. [2022-03-17 17:02:32,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2022-03-17 17:02:32,599 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 17:02:32,600 INFO L500 BasicCegarLoop]: trace histogram [77, 76, 76, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 12, 11, 11, 11, 10, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 17:02:32,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-03-17 17:02:32,827 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 17:02:32,827 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 17:02:32,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 17:02:32,828 INFO L85 PathProgramCache]: Analyzing trace with hash 678663881, now seen corresponding path program 2 times [2022-03-17 17:02:32,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 17:02:32,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30538245] [2022-03-17 17:02:32,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 17:02:32,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 17:02:32,848 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 17:02:32,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1659429052] [2022-03-17 17:02:32,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-17 17:02:32,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 17:02:32,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 17:02:32,849 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 17:02:32,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-03-17 17:02:33,057 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-17 17:02:33,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 17:02:33,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 1228 conjuncts, 65 conjunts are in the unsatisfiable core [2022-03-17 17:02:33,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 17:02:34,156 INFO L134 CoverageAnalysis]: Checked inductivity of 13053 backedges. 184 proven. 12389 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-03-17 17:02:34,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 17:02:35,375 INFO L134 CoverageAnalysis]: Checked inductivity of 13053 backedges. 184 proven. 1445 refuted. 0 times theorem prover too weak. 11424 trivial. 0 not checked. [2022-03-17 17:02:35,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 17:02:35,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30538245] [2022-03-17 17:02:35,375 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 17:02:35,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659429052] [2022-03-17 17:02:35,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659429052] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 17:02:35,376 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-17 17:02:35,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 54 [2022-03-17 17:02:35,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269720982] [2022-03-17 17:02:35,376 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-17 17:02:35,377 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-03-17 17:02:35,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 17:02:35,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-03-17 17:02:35,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2022-03-17 17:02:35,378 INFO L87 Difference]: Start difference. First operand 4273 states and 5370 transitions. Second operand has 54 states, 54 states have (on average 5.148148148148148) internal successors, (278), 54 states have internal predecessors, (278), 38 states have call successors, (164), 22 states have call predecessors, (164), 21 states have return successors, (162), 36 states have call predecessors, (162), 37 states have call successors, (162) [2022-03-17 17:02:37,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 17:02:37,789 INFO L93 Difference]: Finished difference Result 7940 states and 9952 transitions. [2022-03-17 17:02:37,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-03-17 17:02:37,790 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.148148148148148) internal successors, (278), 54 states have internal predecessors, (278), 38 states have call successors, (164), 22 states have call predecessors, (164), 21 states have return successors, (162), 36 states have call predecessors, (162), 37 states have call successors, (162) Word has length 516 [2022-03-17 17:02:37,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 17:02:37,843 INFO L225 Difference]: With dead ends: 7940 [2022-03-17 17:02:37,843 INFO L226 Difference]: Without dead ends: 7902 [2022-03-17 17:02:37,846 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 1079 GetRequests, 978 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1379 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3809, Invalid=6493, Unknown=0, NotChecked=0, Total=10302 [2022-03-17 17:02:37,846 INFO L912 BasicCegarLoop]: 232 mSDtfsCounter, 1473 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 1737 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1473 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 2818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1737 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-17 17:02:37,846 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [1473 Valid, 1237 Invalid, 2818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1737 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-17 17:02:37,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7902 states. [2022-03-17 17:02:37,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7902 to 7438. [2022-03-17 17:02:37,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7438 states, 4502 states have (on average 1.1183918258551755) internal successors, (5035), 4553 states have internal predecessors, (5035), 2190 states have call successors, (2190), 747 states have call predecessors, (2190), 745 states have return successors, (2187), 2137 states have call predecessors, (2187), 2187 states have call successors, (2187) [2022-03-17 17:02:37,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7438 states to 7438 states and 9412 transitions. [2022-03-17 17:02:37,974 INFO L78 Accepts]: Start accepts. Automaton has 7438 states and 9412 transitions. Word has length 516 [2022-03-17 17:02:37,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 17:02:37,975 INFO L478 AbstractCegarLoop]: Abstraction has 7438 states and 9412 transitions. [2022-03-17 17:02:37,976 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.148148148148148) internal successors, (278), 54 states have internal predecessors, (278), 38 states have call successors, (164), 22 states have call predecessors, (164), 21 states have return successors, (162), 36 states have call predecessors, (162), 37 states have call successors, (162) [2022-03-17 17:02:37,976 INFO L276 IsEmpty]: Start isEmpty. Operand 7438 states and 9412 transitions. [2022-03-17 17:02:37,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2022-03-17 17:02:37,993 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 17:02:37,993 INFO L500 BasicCegarLoop]: trace histogram [81, 80, 80, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 11, 10, 10, 10, 10, 10, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 17:02:38,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-03-17 17:02:38,207 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-03-17 17:02:38,207 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 17:02:38,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 17:02:38,208 INFO L85 PathProgramCache]: Analyzing trace with hash -2865793, now seen corresponding path program 3 times [2022-03-17 17:02:38,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 17:02:38,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676081295] [2022-03-17 17:02:38,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 17:02:38,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 17:02:38,223 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 17:02:38,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [317818796] [2022-03-17 17:02:38,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-17 17:02:38,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 17:02:38,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 17:02:38,228 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 17:02:38,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-03-17 17:07:42,481 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2022-03-17 17:07:42,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 17:07:42,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 1173 conjuncts, 65 conjunts are in the unsatisfiable core [2022-03-17 17:07:42,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 17:07:43,714 INFO L134 CoverageAnalysis]: Checked inductivity of 14354 backedges. 160 proven. 13690 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2022-03-17 17:07:43,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 17:07:44,946 INFO L134 CoverageAnalysis]: Checked inductivity of 14354 backedges. 160 proven. 1530 refuted. 0 times theorem prover too weak. 12664 trivial. 0 not checked. [2022-03-17 17:07:44,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 17:07:44,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676081295] [2022-03-17 17:07:44,947 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-17 17:07:44,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317818796] [2022-03-17 17:07:44,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317818796] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 17:07:44,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-17 17:07:44,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 54 [2022-03-17 17:07:44,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879694608] [2022-03-17 17:07:44,948 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-17 17:07:44,949 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-03-17 17:07:44,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 17:07:44,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-03-17 17:07:44,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2022-03-17 17:07:44,950 INFO L87 Difference]: Start difference. First operand 7438 states and 9412 transitions. Second operand has 54 states, 54 states have (on average 5.055555555555555) internal successors, (273), 54 states have internal predecessors, (273), 39 states have call successors, (172), 23 states have call predecessors, (172), 22 states have return successors, (170), 37 states have call predecessors, (170), 38 states have call successors, (170) [2022-03-17 17:07:47,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 17:07:47,260 INFO L93 Difference]: Finished difference Result 7453 states and 9370 transitions. [2022-03-17 17:07:47,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-03-17 17:07:47,261 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.055555555555555) internal successors, (273), 54 states have internal predecessors, (273), 39 states have call successors, (172), 23 states have call predecessors, (172), 22 states have return successors, (170), 37 states have call predecessors, (170), 38 states have call successors, (170) Word has length 533 [2022-03-17 17:07:47,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 17:07:47,280 INFO L225 Difference]: With dead ends: 7453 [2022-03-17 17:07:47,280 INFO L226 Difference]: Without dead ends: 7453 [2022-03-17 17:07:47,282 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 1113 GetRequests, 1012 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1606 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3810, Invalid=6492, Unknown=0, NotChecked=0, Total=10302 [2022-03-17 17:07:47,283 INFO L912 BasicCegarLoop]: 232 mSDtfsCounter, 1505 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 1641 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 2885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1641 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-17 17:07:47,283 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [1505 Valid, 940 Invalid, 2885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1641 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-17 17:07:47,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7453 states. [2022-03-17 17:07:47,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7453 to 7453. [2022-03-17 17:07:47,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7453 states, 4518 states have (on average 1.1053563523683045) internal successors, (4994), 4569 states have internal predecessors, (4994), 2189 states have call successors, (2189), 746 states have call predecessors, (2189), 745 states have return successors, (2187), 2137 states have call predecessors, (2187), 2187 states have call successors, (2187) [2022-03-17 17:07:47,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7453 states to 7453 states and 9370 transitions. [2022-03-17 17:07:47,413 INFO L78 Accepts]: Start accepts. Automaton has 7453 states and 9370 transitions. Word has length 533 [2022-03-17 17:07:47,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 17:07:47,414 INFO L478 AbstractCegarLoop]: Abstraction has 7453 states and 9370 transitions. [2022-03-17 17:07:47,414 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.055555555555555) internal successors, (273), 54 states have internal predecessors, (273), 39 states have call successors, (172), 23 states have call predecessors, (172), 22 states have return successors, (170), 37 states have call predecessors, (170), 38 states have call successors, (170) [2022-03-17 17:07:47,414 INFO L276 IsEmpty]: Start isEmpty. Operand 7453 states and 9370 transitions. [2022-03-17 17:07:47,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 861 [2022-03-17 17:07:47,464 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 17:07:47,464 INFO L500 BasicCegarLoop]: trace histogram [133, 132, 132, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 18, 17, 17, 17, 17, 16, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 17:07:47,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-03-17 17:07:47,683 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-03-17 17:07:47,683 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 17:07:47,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 17:07:47,684 INFO L85 PathProgramCache]: Analyzing trace with hash -652662076, now seen corresponding path program 4 times [2022-03-17 17:07:47,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 17:07:47,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285032226] [2022-03-17 17:07:47,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 17:07:47,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 17:07:47,702 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-17 17:07:47,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [859883029] [2022-03-17 17:07:47,702 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-17 17:07:47,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 17:07:47,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 17:07:47,703 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 17:07:47,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-03-17 17:08:05,328 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-17 17:08:05,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-03-17 17:08:05,329 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-17 17:08:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-17 17:08:12,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-17 17:08:12,585 INFO L614 BasicCegarLoop]: Counterexample is feasible [2022-03-17 17:08:12,586 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-17 17:08:12,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-03-17 17:08:12,787 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-17 17:08:12,790 INFO L718 BasicCegarLoop]: Path program histogram: [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 17:08:12,793 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-17 17:08:12,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:08:12 BasicIcfg [2022-03-17 17:08:12,937 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-17 17:08:12,937 INFO L158 Benchmark]: Toolchain (without parser) took 848919.81ms. Allocated memory was 186.6MB in the beginning and 332.4MB in the end (delta: 145.8MB). Free memory was 130.8MB in the beginning and 133.1MB in the end (delta: -2.4MB). Peak memory consumption was 144.4MB. Max. memory is 8.0GB. [2022-03-17 17:08:12,937 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 186.6MB. Free memory is still 147.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-17 17:08:12,937 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.36ms. Allocated memory was 186.6MB in the beginning and 276.8MB in the end (delta: 90.2MB). Free memory was 130.6MB in the beginning and 249.5MB in the end (delta: -118.9MB). Peak memory consumption was 15.0MB. Max. memory is 8.0GB. [2022-03-17 17:08:12,938 INFO L158 Benchmark]: Boogie Preprocessor took 35.90ms. Allocated memory is still 276.8MB. Free memory was 249.5MB in the beginning and 247.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-17 17:08:12,938 INFO L158 Benchmark]: RCFGBuilder took 347.86ms. Allocated memory is still 276.8MB. Free memory was 247.9MB in the beginning and 234.8MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-03-17 17:08:12,938 INFO L158 Benchmark]: IcfgTransformer took 18.39ms. Allocated memory is still 276.8MB. Free memory was 234.8MB in the beginning and 233.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-17 17:08:12,938 INFO L158 Benchmark]: TraceAbstraction took 848191.08ms. Allocated memory was 276.8MB in the beginning and 332.4MB in the end (delta: 55.6MB). Free memory was 233.2MB in the beginning and 133.1MB in the end (delta: 100.1MB). Peak memory consumption was 156.2MB. Max. memory is 8.0GB. [2022-03-17 17:08:12,939 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 186.6MB. Free memory is still 147.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 320.36ms. Allocated memory was 186.6MB in the beginning and 276.8MB in the end (delta: 90.2MB). Free memory was 130.6MB in the beginning and 249.5MB in the end (delta: -118.9MB). Peak memory consumption was 15.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.90ms. Allocated memory is still 276.8MB. Free memory was 249.5MB in the beginning and 247.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 347.86ms. Allocated memory is still 276.8MB. Free memory was 247.9MB in the beginning and 234.8MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 18.39ms. Allocated memory is still 276.8MB. Free memory was 234.8MB in the beginning and 233.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 848191.08ms. Allocated memory was 276.8MB in the beginning and 332.4MB in the end (delta: 55.6MB). Free memory was 233.2MB in the beginning and 133.1MB in the end (delta: 100.1MB). Peak memory consumption was 156.2MB. Max. memory is 8.0GB. * 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 [\old(counter)=53, counter=0] [L20] int x, y; [L21] long long a, b, p, q, r, s, c, k, xy, yy; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [\old(counter)=0, counter=0, x=2584, y=4181] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) VAL [\old(counter)=0, counter=0, x=2584, y=4181] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 [L33] c = 0 [L34] k = 0 [L35] xy = (long long) x * y [L36] yy = (long long) y * y VAL [\old(counter)=0, a=2584, b=4181, c=0, counter=0, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L37] CALL assume_abort_if_not(xy < 2147483647) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L37] RET assume_abort_if_not(xy < 2147483647) VAL [\old(counter)=0, a=2584, b=4181, c=0, counter=0, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L38] CALL assume_abort_if_not(yy < 2147483647) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L38] RET assume_abort_if_not(yy < 2147483647) VAL [\old(counter)=0, a=2584, b=4181, c=0, counter=0, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=2584, b=4181, c=0, counter=1, counter++=0, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=2584, b=4181, c=2584, counter=1, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=2584, b=4181, c=2584, counter=2, counter++=1, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=2584, b=4181, c=2584, counter=2, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=2584, b=4181, c=2584, counter=2, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=2584, b=4181, c=2584, counter=2, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=2584, b=4181, c=2584, counter=2, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=2584, b=4181, c=2584, counter=2, k=0, p=1, q=0, r=0, s=1, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=4181, b=2584, c=2584, counter=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=4181, b=2584, c=2584, counter=3, counter++=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=3, k=0, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=4, counter++=3, k=0, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=4, k=0, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=4, k=0, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=4, k=0, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=4181, b=2584, c=4181, counter=4, k=0, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=4181, b=2584, c=1597, counter=4, k=1, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=4181, b=2584, c=1597, counter=5, counter++=4, k=1, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=4181, b=2584, c=1597, counter=5, k=1, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=4181, b=2584, c=1597, counter=5, k=1, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=4181, b=2584, c=1597, counter=5, k=1, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=4181, b=2584, c=1597, counter=5, k=1, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=4181, b=2584, c=1597, counter=5, k=1, p=0, q=1, r=1, s=0, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=2584, b=1597, c=1597, counter=5, k=1, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=2584, b=1597, c=1597, counter=6, counter++=5, k=1, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=6, k=0, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=7, counter++=6, k=0, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=7, k=0, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=7, k=0, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=7, k=0, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=2584, b=1597, c=2584, counter=7, k=0, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=2584, b=1597, c=987, counter=7, k=1, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=2584, b=1597, c=987, counter=8, counter++=7, k=1, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=2584, b=1597, c=987, counter=8, k=1, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=2584, b=1597, c=987, counter=8, k=1, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=2584, b=1597, c=987, counter=8, k=1, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=2584, b=1597, c=987, counter=8, k=1, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=2584, b=1597, c=987, counter=8, k=1, p=1, q=-1, r=0, s=1, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=1597, b=987, c=987, counter=8, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=1597, b=987, c=987, counter=9, counter++=8, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=9, k=0, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=10, counter++=9, k=0, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=10, k=0, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=10, k=0, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=10, k=0, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=1597, b=987, c=1597, counter=10, k=0, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=1597, b=987, c=610, counter=10, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=1597, b=987, c=610, counter=11, counter++=10, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=1597, b=987, c=610, counter=11, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=1597, b=987, c=610, counter=11, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=1597, b=987, c=610, counter=11, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=1597, b=987, c=610, counter=11, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=1597, b=987, c=610, counter=11, k=1, p=-1, q=2, r=1, s=-1, temp=0, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=987, b=610, c=610, counter=11, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=987, b=610, c=610, counter=12, counter++=11, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=987, b=610, c=987, counter=12, k=0, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=987, b=610, c=987, counter=13, counter++=12, k=0, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=987, b=610, c=987, counter=13, k=0, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=987, b=610, c=987, counter=13, k=0, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=987, b=610, c=987, counter=13, k=0, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=987, b=610, c=987, counter=13, k=0, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=987, b=610, c=377, counter=13, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=987, b=610, c=377, counter=14, counter++=13, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=987, b=610, c=377, counter=14, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=987, b=610, c=377, counter=14, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=987, b=610, c=377, counter=14, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=987, b=610, c=377, counter=14, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=987, b=610, c=377, counter=14, k=1, p=2, q=-3, r=-1, s=2, temp=1, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=610, b=377, c=377, counter=14, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=610, b=377, c=377, counter=15, counter++=14, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=610, b=377, c=610, counter=15, k=0, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=610, b=377, c=610, counter=16, counter++=15, k=0, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=610, b=377, c=610, counter=16, k=0, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=610, b=377, c=610, counter=16, k=0, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=610, b=377, c=610, counter=16, k=0, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=610, b=377, c=610, counter=16, k=0, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=610, b=377, c=233, counter=16, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=610, b=377, c=233, counter=17, counter++=16, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=610, b=377, c=233, counter=17, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=610, b=377, c=233, counter=17, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=610, b=377, c=233, counter=17, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=610, b=377, c=233, counter=17, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=610, b=377, c=233, counter=17, k=1, p=-3, q=5, r=2, s=-3, temp=-1, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=377, b=233, c=233, counter=17, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=377, b=233, c=233, counter=18, counter++=17, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=377, b=233, c=377, counter=18, k=0, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=377, b=233, c=377, counter=19, counter++=18, k=0, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=377, b=233, c=377, counter=19, k=0, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=377, b=233, c=377, counter=19, k=0, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=377, b=233, c=377, counter=19, k=0, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=377, b=233, c=377, counter=19, k=0, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=377, b=233, c=144, counter=19, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=377, b=233, c=144, counter=20, counter++=19, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=377, b=233, c=144, counter=20, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=377, b=233, c=144, counter=20, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=377, b=233, c=144, counter=20, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=377, b=233, c=144, counter=20, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=377, b=233, c=144, counter=20, k=1, p=5, q=-8, r=-3, s=5, temp=2, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=233, b=144, c=144, counter=20, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=233, b=144, c=144, counter=21, counter++=20, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=233, b=144, c=233, counter=21, k=0, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=233, b=144, c=233, counter=22, counter++=21, k=0, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=22] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=233, b=144, c=233, counter=22, k=0, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=22] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=233, b=144, c=233, counter=22, k=0, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=22] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=233, b=144, c=233, counter=22, k=0, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=22] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=22] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=233, b=144, c=233, counter=22, k=0, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=233, b=144, c=89, counter=22, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=233, b=144, c=89, counter=23, counter++=22, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=23] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=233, b=144, c=89, counter=23, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=23] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=233, b=144, c=89, counter=23, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=23] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=233, b=144, c=89, counter=23, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=23] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=23] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=233, b=144, c=89, counter=23, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=233, b=144, c=89, counter=23, k=1, p=-8, q=13, r=5, s=-8, temp=-3, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=144, b=89, c=89, counter=23, k=1, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=144, b=89, c=89, counter=24, counter++=23, k=1, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=144, b=89, c=144, counter=24, k=0, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=144, b=89, c=144, counter=25, counter++=24, k=0, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=25] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=144, b=89, c=144, counter=25, k=0, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=25] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=144, b=89, c=144, counter=25, k=0, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=25] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=144, b=89, c=144, counter=25, k=0, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=25] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=25] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=144, b=89, c=144, counter=25, k=0, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=144, b=89, c=55, counter=25, k=1, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=144, b=89, c=55, counter=26, counter++=25, k=1, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=26] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=144, b=89, c=55, counter=26, k=1, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=26] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=144, b=89, c=55, counter=26, k=1, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=26] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=144, b=89, c=55, counter=26, k=1, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=26] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=26] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=144, b=89, c=55, counter=26, k=1, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=144, b=89, c=55, counter=26, k=1, p=13, q=-21, r=-8, s=13, temp=5, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=89, b=55, c=55, counter=26, k=1, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=89, b=55, c=55, counter=27, counter++=26, k=1, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=89, b=55, c=89, counter=27, k=0, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=89, b=55, c=89, counter=28, counter++=27, k=0, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=28] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=89, b=55, c=89, counter=28, k=0, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=28] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=89, b=55, c=89, counter=28, k=0, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=28] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=89, b=55, c=89, counter=28, k=0, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=28] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=28] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=89, b=55, c=89, counter=28, k=0, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=89, b=55, c=34, counter=28, k=1, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=89, b=55, c=34, counter=29, counter++=28, k=1, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=29] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=89, b=55, c=34, counter=29, k=1, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=29] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=89, b=55, c=34, counter=29, k=1, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=29] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=89, b=55, c=34, counter=29, k=1, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=29] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=29] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=89, b=55, c=34, counter=29, k=1, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=89, b=55, c=34, counter=29, k=1, p=-21, q=34, r=13, s=-21, temp=-8, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=55, b=34, c=34, counter=29, k=1, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=55, b=34, c=34, counter=30, counter++=29, k=1, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=55, b=34, c=55, counter=30, k=0, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=55, b=34, c=55, counter=31, counter++=30, k=0, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=31] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=55, b=34, c=55, counter=31, k=0, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=31] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=55, b=34, c=55, counter=31, k=0, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=31] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=55, b=34, c=55, counter=31, k=0, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=31] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=31] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=55, b=34, c=55, counter=31, k=0, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=55, b=34, c=21, counter=31, k=1, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=55, b=34, c=21, counter=32, counter++=31, k=1, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=32] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=55, b=34, c=21, counter=32, k=1, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=32] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=55, b=34, c=21, counter=32, k=1, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=32] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=55, b=34, c=21, counter=32, k=1, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=32] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=32] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=55, b=34, c=21, counter=32, k=1, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=55, b=34, c=21, counter=32, k=1, p=34, q=-55, r=-21, s=34, temp=13, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=34, b=21, c=21, counter=32, k=1, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=34, b=21, c=21, counter=33, counter++=32, k=1, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=34, b=21, c=34, counter=33, k=0, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=34, b=21, c=34, counter=34, counter++=33, k=0, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=34] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=34, b=21, c=34, counter=34, k=0, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=34] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=34, b=21, c=34, counter=34, k=0, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=34] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=34, b=21, c=34, counter=34, k=0, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=34] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=34] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=34, b=21, c=34, counter=34, k=0, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=34, b=21, c=13, counter=34, k=1, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=34, b=21, c=13, counter=35, counter++=34, k=1, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=35] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=34, b=21, c=13, counter=35, k=1, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=35] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=34, b=21, c=13, counter=35, k=1, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=35] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=34, b=21, c=13, counter=35, k=1, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=35] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=35] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=34, b=21, c=13, counter=35, k=1, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=34, b=21, c=13, counter=35, k=1, p=-55, q=89, r=34, s=-55, temp=-21, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=21, b=13, c=13, counter=35, k=1, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=21, b=13, c=13, counter=36, counter++=35, k=1, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=21, b=13, c=21, counter=36, k=0, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=21, b=13, c=21, counter=37, counter++=36, k=0, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=37] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=21, b=13, c=21, counter=37, k=0, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=37] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=21, b=13, c=21, counter=37, k=0, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=37] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=21, b=13, c=21, counter=37, k=0, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=37] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=37] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=21, b=13, c=21, counter=37, k=0, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=21, b=13, c=8, counter=37, k=1, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=21, b=13, c=8, counter=38, counter++=37, k=1, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=38] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=21, b=13, c=8, counter=38, k=1, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=38] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=21, b=13, c=8, counter=38, k=1, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=38] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=21, b=13, c=8, counter=38, k=1, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=38] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=38] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=21, b=13, c=8, counter=38, k=1, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=21, b=13, c=8, counter=38, k=1, p=89, q=-144, r=-55, s=89, temp=34, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=13, b=8, c=8, counter=38, k=1, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=13, b=8, c=8, counter=39, counter++=38, k=1, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=13, b=8, c=13, counter=39, k=0, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=13, b=8, c=13, counter=40, counter++=39, k=0, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=40] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=13, b=8, c=13, counter=40, k=0, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=40] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=13, b=8, c=13, counter=40, k=0, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=40] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=13, b=8, c=13, counter=40, k=0, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=40] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=40] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=13, b=8, c=13, counter=40, k=0, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=13, b=8, c=5, counter=40, k=1, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=13, b=8, c=5, counter=41, counter++=40, k=1, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=41] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=13, b=8, c=5, counter=41, k=1, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=41] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=13, b=8, c=5, counter=41, k=1, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=41] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=13, b=8, c=5, counter=41, k=1, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=41] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=41] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=13, b=8, c=5, counter=41, k=1, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=13, b=8, c=5, counter=41, k=1, p=-144, q=233, r=89, s=-144, temp=-55, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=8, b=5, c=5, counter=41, k=1, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=8, b=5, c=5, counter=42, counter++=41, k=1, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=8, b=5, c=8, counter=42, k=0, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=8, b=5, c=8, counter=43, counter++=42, k=0, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=43] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=8, b=5, c=8, counter=43, k=0, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=43] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=8, b=5, c=8, counter=43, k=0, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=43] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=8, b=5, c=8, counter=43, k=0, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=43] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=43] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=8, b=5, c=8, counter=43, k=0, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=8, b=5, c=3, counter=43, k=1, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=8, b=5, c=3, counter=44, counter++=43, k=1, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=44] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=8, b=5, c=3, counter=44, k=1, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=44] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=8, b=5, c=3, counter=44, k=1, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=44] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=8, b=5, c=3, counter=44, k=1, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=44] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=44] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=8, b=5, c=3, counter=44, k=1, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=8, b=5, c=3, counter=44, k=1, p=233, q=-377, r=-144, s=233, temp=89, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=5, b=3, c=3, counter=44, k=1, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=3, counter=45, counter++=44, k=1, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=5, b=3, c=5, counter=45, k=0, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=5, counter=46, counter++=45, k=0, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=46] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=5, b=3, c=5, counter=46, k=0, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=46] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=5, b=3, c=5, counter=46, k=0, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=46] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=5, b=3, c=5, counter=46, k=0, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=46] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=46] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=5, b=3, c=5, counter=46, k=0, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=5, b=3, c=2, counter=46, k=1, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=5, b=3, c=2, counter=47, counter++=46, k=1, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=47] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=5, b=3, c=2, counter=47, k=1, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=47] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=5, b=3, c=2, counter=47, k=1, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=47] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=5, b=3, c=2, counter=47, k=1, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=47] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=47] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=5, b=3, c=2, counter=47, k=1, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=5, b=3, c=2, counter=47, k=1, p=-377, q=610, r=233, s=-377, temp=-144, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=3, b=2, c=2, counter=47, k=1, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=2, counter=48, counter++=47, k=1, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND TRUE counter++<50 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=3, b=2, c=3, counter=48, k=0, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=3, counter=49, counter++=48, k=0, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=49] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=3, b=2, c=3, counter=49, k=0, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=49] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=3, b=2, c=3, counter=49, k=0, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=49] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=3, b=2, c=3, counter=49, k=0, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=49] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=49] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=3, b=2, c=3, counter=49, k=0, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 VAL [\old(counter)=0, a=3, b=2, c=1, counter=49, k=1, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L46] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=1, counter=50, counter++=49, k=1, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L46] COND TRUE counter++<50 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=50] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=3, b=2, c=1, counter=50, k=1, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=50] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=3, b=2, c=1, counter=50, k=1, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=50] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=3, b=2, c=1, counter=50, k=1, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=50] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=50] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=3, b=2, c=1, counter=50, k=1, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=3, b=2, c=1, counter=50, k=1, p=610, q=-987, r=-377, s=610, temp=233, x=2584, xy=10803704, y=4181, yy=17480761] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=2, b=1, c=1, counter=50, k=1, p=-987, q=1597, r=610, s=-987, temp=-377, x=2584, xy=10803704, y=4181, yy=17480761] [L40] EXPR counter++ VAL [\old(counter)=0, a=2, b=1, c=1, counter=51, counter++=50, k=1, p=-987, q=1597, r=610, s=-987, temp=-377, x=2584, xy=10803704, y=4181, yy=17480761] [L40] COND FALSE !(counter++<50) [L70] CALL __VERIFIER_assert(q*x + s*y == 0) VAL [\old(cond)=0, \old(counter)=0, counter=51] [L11] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=51] [L13] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 848.0s, OverallIterations: 27, TraceHistogramMax: 133, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 442.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 52 mSolverCounterUnknown, 6432 SdHoareTripleChecker+Valid, 155.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6352 mSDsluCounter, 10694 SdHoareTripleChecker+Invalid, 153.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8745 mSDsCounter, 6567 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8593 IncrementalHoareTripleChecker+Invalid, 15212 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6567 mSolverCounterUnsat, 1949 mSDtfsCounter, 8593 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6298 GetRequests, 5583 SyntacticMatches, 20 SemanticMatches, 695 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5940 ImplicationChecksByTransitivity, 321.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7453occurred in iteration=26, InterpolantAutomatonStates: 625, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 26 MinimizatonAttempts, 1456 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 322.7s SatisfiabilityAnalysisTime, 67.3s InterpolantComputationTime, 4072 NumberOfCodeBlocks, 3952 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 5940 ConstructedInterpolants, 0 QuantifiedInterpolants, 29654 SizeOfPredicates, 214 NumberOfNonLiveVariables, 8380 ConjunctsInSsa, 773 ConjunctsInUnsatCore, 45 InterpolantComputations, 7 PerfectInterpolantSequences, 37510/73764 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-03-17 17:08:13,019 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...