/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/fermat2-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-06 06:58:56,740 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-06 06:58:56,741 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-06 06:58:56,769 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-06 06:58:56,769 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-06 06:58:56,770 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-06 06:58:56,773 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-06 06:58:56,774 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-06 06:58:56,775 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-06 06:58:56,775 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-06 06:58:56,776 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-06 06:58:56,777 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-06 06:58:56,777 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-06 06:58:56,777 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-06 06:58:56,778 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-06 06:58:56,779 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-06 06:58:56,779 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-06 06:58:56,780 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-06 06:58:56,781 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-06 06:58:56,782 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-06 06:58:56,783 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-06 06:58:56,788 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-06 06:58:56,791 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-06 06:58:56,792 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-06 06:58:56,792 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-06 06:58:56,794 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-06 06:58:56,794 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-06 06:58:56,794 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-06 06:58:56,795 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-06 06:58:56,795 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-06 06:58:56,795 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-06 06:58:56,796 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-06 06:58:56,796 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-06 06:58:56,797 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-06 06:58:56,797 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-06 06:58:56,798 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-06 06:58:56,798 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-06 06:58:56,798 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-06 06:58:56,798 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-06 06:58:56,799 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-06 06:58:56,799 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-06 06:58:56,816 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-06 06:58:56,816 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-06 06:58:56,821 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-06 06:58:56,822 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-06 06:58:56,822 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-06 06:58:56,823 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-06 06:58:56,823 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-06 06:58:56,823 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-06 06:58:56,823 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-06 06:58:56,823 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-06 06:58:56,823 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-06 06:58:56,824 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-06 06:58:56,824 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-06 06:58:56,824 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-06 06:58:56,824 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-06 06:58:56,824 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-06 06:58:56,824 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-06 06:58:56,824 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-06 06:58:56,824 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-06 06:58:56,824 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-06 06:58:56,824 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 06:58:56,825 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-06 06:58:56,825 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-06 06:58:56,825 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-06 06:58:56,825 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-04-06 06:58:56,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-06 06:58:56,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-06 06:58:56,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-06 06:58:56,997 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-06 06:58:56,998 INFO L275 PluginConnector]: CDTParser initialized [2022-04-06 06:58:56,999 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound50.c [2022-04-06 06:58:57,033 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cffa5c950/ce25f819f5d94432bc72aa5d22907f23/FLAG3f8467bc1 [2022-04-06 06:58:57,344 INFO L306 CDTParser]: Found 1 translation units. [2022-04-06 06:58:57,344 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound50.c [2022-04-06 06:58:57,348 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cffa5c950/ce25f819f5d94432bc72aa5d22907f23/FLAG3f8467bc1 [2022-04-06 06:58:57,356 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cffa5c950/ce25f819f5d94432bc72aa5d22907f23 [2022-04-06 06:58:57,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-06 06:58:57,360 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-06 06:58:57,363 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-06 06:58:57,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-06 06:58:57,366 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-06 06:58:57,366 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 06:58:57" (1/1) ... [2022-04-06 06:58:57,367 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b3e9a06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:58:57, skipping insertion in model container [2022-04-06 06:58:57,367 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 06:58:57" (1/1) ... [2022-04-06 06:58:57,371 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-06 06:58:57,383 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-06 06:58:57,488 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/fermat2-ll_unwindbound50.c[524,537] [2022-04-06 06:58:57,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 06:58:57,506 INFO L203 MainTranslator]: Completed pre-run [2022-04-06 06:58:57,522 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/fermat2-ll_unwindbound50.c[524,537] [2022-04-06 06:58:57,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 06:58:57,534 INFO L208 MainTranslator]: Completed translation [2022-04-06 06:58:57,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:58:57 WrapperNode [2022-04-06 06:58:57,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-06 06:58:57,535 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-06 06:58:57,535 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-06 06:58:57,535 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-06 06:58:57,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:58:57" (1/1) ... [2022-04-06 06:58:57,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:58:57" (1/1) ... [2022-04-06 06:58:57,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:58:57" (1/1) ... [2022-04-06 06:58:57,549 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:58:57" (1/1) ... [2022-04-06 06:58:57,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:58:57" (1/1) ... [2022-04-06 06:58:57,553 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:58:57" (1/1) ... [2022-04-06 06:58:57,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:58:57" (1/1) ... [2022-04-06 06:58:57,555 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-06 06:58:57,555 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-06 06:58:57,555 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-06 06:58:57,556 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-06 06:58:57,556 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:58:57" (1/1) ... [2022-04-06 06:58:57,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 06:58:57,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 06:58:57,579 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-04-06 06:58:57,580 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-04-06 06:58:57,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-06 06:58:57,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-06 06:58:57,601 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-06 06:58:57,601 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-06 06:58:57,601 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-06 06:58:57,601 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-06 06:58:57,601 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-06 06:58:57,601 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-06 06:58:57,601 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-06 06:58:57,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-06 06:58:57,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-06 06:58:57,602 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-06 06:58:57,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-06 06:58:57,602 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-06 06:58:57,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-06 06:58:57,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-06 06:58:57,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-06 06:58:57,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-06 06:58:57,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-06 06:58:57,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-06 06:58:57,645 INFO L234 CfgBuilder]: Building ICFG [2022-04-06 06:58:57,646 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-06 06:58:57,742 INFO L275 CfgBuilder]: Performing block encoding [2022-04-06 06:58:57,746 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-06 06:58:57,746 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-06 06:58:57,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 06:58:57 BoogieIcfgContainer [2022-04-06 06:58:57,747 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-06 06:58:57,748 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-06 06:58:57,748 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-06 06:58:57,748 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-06 06:58:57,750 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 06:58:57" (1/1) ... [2022-04-06 06:58:57,752 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-06 06:58:57,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.04 06:58:57 BasicIcfg [2022-04-06 06:58:57,776 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-06 06:58:57,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-06 06:58:57,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-06 06:58:57,778 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-06 06:58:57,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 06:58:57" (1/4) ... [2022-04-06 06:58:57,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35cd308f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 06:58:57, skipping insertion in model container [2022-04-06 06:58:57,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 06:58:57" (2/4) ... [2022-04-06 06:58:57,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35cd308f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 06:58:57, skipping insertion in model container [2022-04-06 06:58:57,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 06:58:57" (3/4) ... [2022-04-06 06:58:57,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35cd308f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 06:58:57, skipping insertion in model container [2022-04-06 06:58:57,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.04 06:58:57" (4/4) ... [2022-04-06 06:58:57,780 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound50.cJordan [2022-04-06 06:58:57,786 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-06 06:58:57,786 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-06 06:58:57,819 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-06 06:58:57,823 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-04-06 06:58:57,824 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-06 06:58:57,841 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-06 06:58:57,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-06 06:58:57,851 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 06:58:57,852 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 06:58:57,852 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 06:58:57,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 06:58:57,859 INFO L85 PathProgramCache]: Analyzing trace with hash 734203501, now seen corresponding path program 1 times [2022-04-06 06:58:57,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 06:58:57,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251689961] [2022-04-06 06:58:57,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:58:57,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 06:58:57,952 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 06:58:57,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [430843330] [2022-04-06 06:58:57,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:58:57,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:58:57,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 06:58:57,955 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-04-06 06:58:57,956 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-04-06 06:58:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 06:58:58,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-06 06:58:58,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 06:58:58,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-06 06:58:58,086 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 06:58:58,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 06:58:58,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251689961] [2022-04-06 06:58:58,087 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 06:58:58,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430843330] [2022-04-06 06:58:58,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430843330] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 06:58:58,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 06:58:58,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-06 06:58:58,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36766960] [2022-04-06 06:58:58,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 06:58:58,097 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-06 06:58:58,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 06:58:58,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-06 06:58:58,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-06 06:58:58,120 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-06 06:58:58,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 06:58:58,131 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-06 06:58:58,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-06 06:58:58,132 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-06 06:58:58,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 06:58:58,138 INFO L225 Difference]: With dead ends: 30 [2022-04-06 06:58:58,138 INFO L226 Difference]: Without dead ends: 25 [2022-04-06 06:58:58,140 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 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-04-06 06:58:58,143 INFO L913 BasicCegarLoop]: 34 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, 34 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-04-06 06:58:58,145 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 06:58:58,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-06 06:58:58,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-06 06:58:58,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-06 06:58:58,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-06 06:58:58,175 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2022-04-06 06:58:58,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 06:58:58,175 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-06 06:58:58,175 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-06 06:58:58,175 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-06 06:58:58,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-06 06:58:58,177 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 06:58:58,177 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 06:58:58,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-06 06:58:58,389 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-04-06 06:58:58,390 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 06:58:58,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 06:58:58,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1669026344, now seen corresponding path program 1 times [2022-04-06 06:58:58,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 06:58:58,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081371958] [2022-04-06 06:58:58,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:58:58,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 06:58:58,401 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 06:58:58,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1506635651] [2022-04-06 06:58:58,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:58:58,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:58:58,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 06:58:58,425 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-04-06 06:58:58,426 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-04-06 06:58:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 06:58:58,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-06 06:58:58,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 06:58:58,544 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-06 06:58:58,545 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 06:58:58,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 06:58:58,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081371958] [2022-04-06 06:58:58,545 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 06:58:58,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506635651] [2022-04-06 06:58:58,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506635651] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 06:58:58,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 06:58:58,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 06:58:58,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309700150] [2022-04-06 06:58:58,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 06:58:58,546 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 06:58:58,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 06:58:58,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 06:58:58,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 06:58:58,547 INFO L87 Difference]: Start difference. First operand 25 states and 29 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-06 06:58:58,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 06:58:58,561 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-06 06:58:58,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 06:58:58,562 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-06 06:58:58,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 06:58:58,562 INFO L225 Difference]: With dead ends: 27 [2022-04-06 06:58:58,562 INFO L226 Difference]: Without dead ends: 27 [2022-04-06 06:58:58,563 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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-04-06 06:58:58,563 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 06:58:58,564 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 06:58:58,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-06 06:58:58,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-06 06:58:58,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-06 06:58:58,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-06 06:58:58,567 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-04-06 06:58:58,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 06:58:58,568 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-06 06:58:58,568 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-06 06:58:58,569 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-06 06:58:58,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-06 06:58:58,569 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 06:58:58,569 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 06:58:58,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-06 06:58:58,775 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-04-06 06:58:58,775 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 06:58:58,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 06:58:58,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1667953868, now seen corresponding path program 1 times [2022-04-06 06:58:58,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 06:58:58,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142781859] [2022-04-06 06:58:58,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:58:58,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 06:58:58,790 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 06:58:58,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1135175943] [2022-04-06 06:58:58,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:58:58,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:58:58,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 06:58:58,795 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-04-06 06:58:58,796 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-04-06 06:58:58,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 06:58:58,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-06 06:58:58,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 06:58:59,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-06 06:58:59,157 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 06:58:59,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 06:58:59,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142781859] [2022-04-06 06:58:59,158 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 06:58:59,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135175943] [2022-04-06 06:58:59,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135175943] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 06:58:59,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 06:58:59,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 06:58:59,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598671816] [2022-04-06 06:58:59,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 06:58:59,159 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 06:58:59,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 06:58:59,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 06:58:59,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 06:58:59,159 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-06 06:59:01,995 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-04-06 06:59:03,131 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 06:59:03,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 06:59:03,151 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-06 06:59:03,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 06:59:03,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-06 06:59:03,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 06:59:03,153 INFO L225 Difference]: With dead ends: 37 [2022-04-06 06:59:03,153 INFO L226 Difference]: Without dead ends: 37 [2022-04-06 06:59:03,154 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-06 06:59:03,154 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-06 06:59:03,155 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 85 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2022-04-06 06:59:03,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-06 06:59:03,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2022-04-06 06:59:03,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-06 06:59:03,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-04-06 06:59:03,159 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 23 [2022-04-06 06:59:03,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 06:59:03,159 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-04-06 06:59:03,159 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-06 06:59:03,160 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-06 06:59:03,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-06 06:59:03,160 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 06:59:03,160 INFO L499 BasicCegarLoop]: trace histogram [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] [2022-04-06 06:59:03,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-06 06:59:03,363 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-04-06 06:59:03,364 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 06:59:03,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 06:59:03,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1179905874, now seen corresponding path program 1 times [2022-04-06 06:59:03,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 06:59:03,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148767603] [2022-04-06 06:59:03,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:59:03,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 06:59:03,372 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 06:59:03,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1127586266] [2022-04-06 06:59:03,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:59:03,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:59:03,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 06:59:03,374 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-04-06 06:59:03,379 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-04-06 06:59:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 06:59:03,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-06 06:59:03,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 06:59:03,560 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-06 06:59:03,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 06:59:03,708 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-06 06:59:03,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 06:59:03,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148767603] [2022-04-06 06:59:03,709 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 06:59:03,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127586266] [2022-04-06 06:59:03,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127586266] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 06:59:03,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 06:59:03,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-06 06:59:03,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334885179] [2022-04-06 06:59:03,710 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 06:59:03,710 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-06 06:59:03,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 06:59:03,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-06 06:59:03,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-06 06:59:03,711 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-06 06:59:03,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 06:59:03,918 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-04-06 06:59:03,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-06 06:59:03,918 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 29 [2022-04-06 06:59:03,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 06:59:03,920 INFO L225 Difference]: With dead ends: 41 [2022-04-06 06:59:03,921 INFO L226 Difference]: Without dead ends: 38 [2022-04-06 06:59:03,922 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-06 06:59:03,927 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 28 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 06:59:03,927 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 86 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 06:59:03,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-06 06:59:03,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 29. [2022-04-06 06:59:03,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-06 06:59:03,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-06 06:59:03,930 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2022-04-06 06:59:03,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 06:59:03,931 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-06 06:59:03,931 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-06 06:59:03,931 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-06 06:59:03,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-06 06:59:03,932 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 06:59:03,932 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 06:59:03,953 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-04-06 06:59:04,153 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-04-06 06:59:04,153 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 06:59:04,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 06:59:04,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1668946595, now seen corresponding path program 1 times [2022-04-06 06:59:04,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 06:59:04,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460517739] [2022-04-06 06:59:04,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:59:04,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 06:59:04,161 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 06:59:04,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [621872185] [2022-04-06 06:59:04,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:59:04,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:59:04,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 06:59:04,166 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-04-06 06:59:04,167 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-04-06 06:59:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 06:59:04,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-06 06:59:04,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 06:59:04,304 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-06 06:59:04,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 06:59:04,365 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-06 06:59:04,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 06:59:04,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460517739] [2022-04-06 06:59:04,366 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 06:59:04,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621872185] [2022-04-06 06:59:04,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621872185] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 06:59:04,366 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 06:59:04,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-06 06:59:04,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931085926] [2022-04-06 06:59:04,366 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 06:59:04,366 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-06 06:59:04,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 06:59:04,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-06 06:59:04,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-06 06:59:04,367 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-06 06:59:04,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 06:59:04,427 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-06 06:59:04,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-06 06:59:04,428 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 32 [2022-04-06 06:59:04,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 06:59:04,429 INFO L225 Difference]: With dead ends: 56 [2022-04-06 06:59:04,429 INFO L226 Difference]: Without dead ends: 56 [2022-04-06 06:59:04,429 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-06 06:59:04,430 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 32 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 06:59:04,430 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 128 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 06:59:04,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-06 06:59:04,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-06 06:59:04,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-06 06:59:04,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-04-06 06:59:04,435 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 32 [2022-04-06 06:59:04,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 06:59:04,436 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-04-06 06:59:04,436 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-06 06:59:04,436 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-06 06:59:04,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-06 06:59:04,437 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 06:59:04,437 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 06:59:04,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-06 06:59:04,652 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-04-06 06:59:04,652 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 06:59:04,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 06:59:04,653 INFO L85 PathProgramCache]: Analyzing trace with hash -906969448, now seen corresponding path program 2 times [2022-04-06 06:59:04,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 06:59:04,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086662497] [2022-04-06 06:59:04,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:59:04,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 06:59:04,661 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 06:59:04,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [632562090] [2022-04-06 06:59:04,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 06:59:04,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:59:04,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 06:59:04,662 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-04-06 06:59:04,663 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-04-06 06:59:04,706 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 06:59:04,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 06:59:04,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-06 06:59:04,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 06:59:04,850 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-06 06:59:04,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 06:59:05,035 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-06 06:59:05,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 06:59:05,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086662497] [2022-04-06 06:59:05,036 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 06:59:05,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632562090] [2022-04-06 06:59:05,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632562090] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 06:59:05,037 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 06:59:05,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-06 06:59:05,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889871978] [2022-04-06 06:59:05,037 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 06:59:05,039 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-06 06:59:05,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 06:59:05,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-06 06:59:05,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-06 06:59:05,040 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-06 06:59:05,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 06:59:05,207 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-06 06:59:05,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-06 06:59:05,209 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) Word has length 59 [2022-04-06 06:59:05,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 06:59:05,214 INFO L225 Difference]: With dead ends: 110 [2022-04-06 06:59:05,214 INFO L226 Difference]: Without dead ends: 110 [2022-04-06 06:59:05,214 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-04-06 06:59:05,216 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 101 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 06:59:05,216 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 148 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 06:59:05,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-06 06:59:05,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-04-06 06:59:05,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-06 06:59:05,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2022-04-06 06:59:05,232 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 59 [2022-04-06 06:59:05,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 06:59:05,233 INFO L478 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2022-04-06 06:59:05,233 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-06 06:59:05,233 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-06 06:59:05,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-06 06:59:05,234 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 06:59:05,235 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 06:59:05,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-06 06:59:05,442 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-04-06 06:59:05,442 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 06:59:05,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 06:59:05,442 INFO L85 PathProgramCache]: Analyzing trace with hash 191644600, now seen corresponding path program 3 times [2022-04-06 06:59:05,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 06:59:05,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482806928] [2022-04-06 06:59:05,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:59:05,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 06:59:05,456 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 06:59:05,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1622952318] [2022-04-06 06:59:05,457 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-06 06:59:05,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:59:05,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 06:59:05,467 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-04-06 06:59:05,468 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-04-06 06:59:07,523 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-04-06 06:59:07,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 06:59:07,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-06 06:59:07,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 06:59:07,779 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-06 06:59:07,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 06:59:08,105 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-06 06:59:08,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 06:59:08,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482806928] [2022-04-06 06:59:08,106 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 06:59:08,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622952318] [2022-04-06 06:59:08,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622952318] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 06:59:08,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 06:59:08,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-06 06:59:08,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841917067] [2022-04-06 06:59:08,106 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 06:59:08,107 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-06 06:59:08,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 06:59:08,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-06 06:59:08,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-06 06:59:08,108 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) [2022-04-06 06:59:08,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 06:59:08,454 INFO L93 Difference]: Finished difference Result 218 states and 241 transitions. [2022-04-06 06:59:08,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-06 06:59:08,455 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) Word has length 113 [2022-04-06 06:59:08,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 06:59:08,456 INFO L225 Difference]: With dead ends: 218 [2022-04-06 06:59:08,456 INFO L226 Difference]: Without dead ends: 218 [2022-04-06 06:59:08,457 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2022-04-06 06:59:08,457 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 262 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 06:59:08,457 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [262 Valid, 238 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 06:59:08,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-04-06 06:59:08,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2022-04-06 06:59:08,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 166 states have (on average 1.1385542168674698) internal successors, (189), 166 states have internal predecessors, (189), 27 states have call successors, (27), 26 states have call predecessors, (27), 24 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-06 06:59:08,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 241 transitions. [2022-04-06 06:59:08,473 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 241 transitions. Word has length 113 [2022-04-06 06:59:08,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 06:59:08,473 INFO L478 AbstractCegarLoop]: Abstraction has 218 states and 241 transitions. [2022-04-06 06:59:08,473 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) [2022-04-06 06:59:08,473 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 241 transitions. [2022-04-06 06:59:08,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-04-06 06:59:08,475 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 06:59:08,475 INFO L499 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 06:59:08,481 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-04-06 06:59:08,678 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-04-06 06:59:08,678 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 06:59:08,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 06:59:08,678 INFO L85 PathProgramCache]: Analyzing trace with hash -698087944, now seen corresponding path program 4 times [2022-04-06 06:59:08,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 06:59:08,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919910902] [2022-04-06 06:59:08,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:59:08,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 06:59:08,702 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 06:59:08,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2115615248] [2022-04-06 06:59:08,703 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-06 06:59:08,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:59:08,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 06:59:08,717 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-04-06 06:59:08,718 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-04-06 06:59:08,952 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-06 06:59:08,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 06:59:08,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-06 06:59:08,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 06:59:09,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 44 proven. 2123 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-06 06:59:09,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 06:59:10,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 44 proven. 1199 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked. [2022-04-06 06:59:10,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 06:59:10,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919910902] [2022-04-06 06:59:10,512 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 06:59:10,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115615248] [2022-04-06 06:59:10,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115615248] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 06:59:10,512 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 06:59:10,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-04-06 06:59:10,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659930341] [2022-04-06 06:59:10,512 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 06:59:10,514 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-06 06:59:10,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 06:59:10,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-06 06:59:10,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2022-04-06 06:59:10,516 INFO L87 Difference]: Start difference. First operand 218 states and 241 transitions. Second operand has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) [2022-04-06 06:59:11,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 06:59:11,798 INFO L93 Difference]: Finished difference Result 434 states and 481 transitions. [2022-04-06 06:59:11,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-04-06 06:59:11,799 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) Word has length 221 [2022-04-06 06:59:11,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 06:59:11,802 INFO L225 Difference]: With dead ends: 434 [2022-04-06 06:59:11,802 INFO L226 Difference]: Without dead ends: 434 [2022-04-06 06:59:11,805 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2022-04-06 06:59:11,805 INFO L913 BasicCegarLoop]: 71 mSDtfsCounter, 656 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-06 06:59:11,806 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [656 Valid, 500 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-06 06:59:11,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-04-06 06:59:11,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2022-04-06 06:59:11,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 334 states have (on average 1.1407185628742516) internal successors, (381), 334 states have internal predecessors, (381), 51 states have call successors, (51), 50 states have call predecessors, (51), 48 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-06 06:59:11,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 481 transitions. [2022-04-06 06:59:11,833 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 481 transitions. Word has length 221 [2022-04-06 06:59:11,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 06:59:11,834 INFO L478 AbstractCegarLoop]: Abstraction has 434 states and 481 transitions. [2022-04-06 06:59:11,834 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) [2022-04-06 06:59:11,834 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 481 transitions. [2022-04-06 06:59:11,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2022-04-06 06:59:11,841 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 06:59:11,841 INFO L499 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 06:59:11,882 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-04-06 06:59:12,043 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-04-06 06:59:12,044 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 06:59:12,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 06:59:12,044 INFO L85 PathProgramCache]: Analyzing trace with hash -619812232, now seen corresponding path program 5 times [2022-04-06 06:59:12,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 06:59:12,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158734089] [2022-04-06 06:59:12,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:59:12,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 06:59:12,064 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 06:59:12,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1915176510] [2022-04-06 06:59:12,064 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-06 06:59:12,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:59:12,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 06:59:12,065 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-04-06 06:59:12,066 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-04-06 06:59:14,284 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2022-04-06 06:59:14,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 06:59:14,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 97 conjunts are in the unsatisfiable core [2022-04-06 06:59:14,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 06:59:15,724 INFO L134 CoverageAnalysis]: Checked inductivity of 9503 backedges. 92 proven. 9407 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-06 06:59:15,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 06:59:16,455 INFO L134 CoverageAnalysis]: Checked inductivity of 9503 backedges. 92 proven. 5267 refuted. 0 times theorem prover too weak. 4144 trivial. 0 not checked. [2022-04-06 06:59:16,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 06:59:16,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158734089] [2022-04-06 06:59:16,455 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 06:59:16,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915176510] [2022-04-06 06:59:16,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915176510] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 06:59:16,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 06:59:16,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 54 [2022-04-06 06:59:16,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039294909] [2022-04-06 06:59:16,456 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 06:59:16,457 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-06 06:59:16,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 06:59:16,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-06 06:59:16,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2022-04-06 06:59:16,458 INFO L87 Difference]: Start difference. First operand 434 states and 481 transitions. Second operand has 54 states, 54 states have (on average 6.62962962962963) internal successors, (358), 54 states have internal predecessors, (358), 52 states have call successors, (100), 49 states have call predecessors, (100), 48 states have return successors, (98), 50 states have call predecessors, (98), 51 states have call successors, (98) [2022-04-06 06:59:17,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 06:59:17,626 INFO L93 Difference]: Finished difference Result 470 states and 521 transitions. [2022-04-06 06:59:17,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-04-06 06:59:17,627 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 6.62962962962963) internal successors, (358), 54 states have internal predecessors, (358), 52 states have call successors, (100), 49 states have call predecessors, (100), 48 states have return successors, (98), 50 states have call predecessors, (98), 51 states have call successors, (98) Word has length 437 [2022-04-06 06:59:17,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 06:59:17,637 INFO L225 Difference]: With dead ends: 470 [2022-04-06 06:59:17,637 INFO L226 Difference]: Without dead ends: 470 [2022-04-06 06:59:17,640 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 922 GetRequests, 820 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3926, Invalid=6580, Unknown=0, NotChecked=0, Total=10506 [2022-04-06 06:59:17,640 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 336 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-06 06:59:17,640 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 486 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-06 06:59:17,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-04-06 06:59:17,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2022-04-06 06:59:17,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 362 states have (on average 1.1408839779005524) internal successors, (413), 362 states have internal predecessors, (413), 55 states have call successors, (55), 54 states have call predecessors, (55), 52 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-06 06:59:17,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 521 transitions. [2022-04-06 06:59:17,654 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 521 transitions. Word has length 437 [2022-04-06 06:59:17,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 06:59:17,654 INFO L478 AbstractCegarLoop]: Abstraction has 470 states and 521 transitions. [2022-04-06 06:59:17,655 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 6.62962962962963) internal successors, (358), 54 states have internal predecessors, (358), 52 states have call successors, (100), 49 states have call predecessors, (100), 48 states have return successors, (98), 50 states have call predecessors, (98), 51 states have call successors, (98) [2022-04-06 06:59:17,655 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 521 transitions. [2022-04-06 06:59:17,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2022-04-06 06:59:17,661 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 06:59:17,661 INFO L499 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 50, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 06:59:17,677 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-04-06 06:59:17,875 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-04-06 06:59:17,876 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 06:59:17,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 06:59:17,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1070552264, now seen corresponding path program 6 times [2022-04-06 06:59:17,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 06:59:17,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808045253] [2022-04-06 06:59:17,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 06:59:17,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 06:59:17,903 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 06:59:17,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1159354343] [2022-04-06 06:59:17,903 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-06 06:59:17,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 06:59:17,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 06:59:17,904 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-04-06 06:59:17,923 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-04-06 07:06:13,354 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2022-04-06 07:06:13,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-06 07:06:13,355 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-06 07:06:13,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-06 07:06:13,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-06 07:06:13,758 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-06 07:06:13,759 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-06 07:06:13,801 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-04-06 07:06:13,975 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-04-06 07:06:13,977 INFO L719 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1] [2022-04-06 07:06:13,980 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-06 07:06:14,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 07:06:14 BasicIcfg [2022-04-06 07:06:14,065 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-06 07:06:14,065 INFO L158 Benchmark]: Toolchain (without parser) took 436705.37ms. Allocated memory was 215.0MB in the beginning and 335.5MB in the end (delta: 120.6MB). Free memory was 165.0MB in the beginning and 148.1MB in the end (delta: 16.9MB). Peak memory consumption was 138.1MB. Max. memory is 8.0GB. [2022-04-06 07:06:14,065 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 215.0MB. Free memory was 181.5MB in the beginning and 181.4MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-06 07:06:14,065 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.33ms. Allocated memory is still 215.0MB. Free memory was 164.9MB in the beginning and 191.0MB in the end (delta: -26.1MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. [2022-04-06 07:06:14,065 INFO L158 Benchmark]: Boogie Preprocessor took 20.09ms. Allocated memory is still 215.0MB. Free memory was 191.0MB in the beginning and 189.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-06 07:06:14,066 INFO L158 Benchmark]: RCFGBuilder took 191.88ms. Allocated memory is still 215.0MB. Free memory was 189.6MB in the beginning and 179.5MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-06 07:06:14,066 INFO L158 Benchmark]: IcfgTransformer took 28.10ms. Allocated memory is still 215.0MB. Free memory was 179.5MB in the beginning and 178.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-06 07:06:14,066 INFO L158 Benchmark]: TraceAbstraction took 436287.94ms. Allocated memory was 215.0MB in the beginning and 335.5MB in the end (delta: 120.6MB). Free memory was 177.4MB in the beginning and 148.1MB in the end (delta: 29.2MB). Peak memory consumption was 150.6MB. Max. memory is 8.0GB. [2022-04-06 07:06:14,067 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.09ms. Allocated memory is still 215.0MB. Free memory was 181.5MB in the beginning and 181.4MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 171.33ms. Allocated memory is still 215.0MB. Free memory was 164.9MB in the beginning and 191.0MB in the end (delta: -26.1MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.09ms. Allocated memory is still 215.0MB. Free memory was 191.0MB in the beginning and 189.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 191.88ms. Allocated memory is still 215.0MB. Free memory was 189.6MB in the beginning and 179.5MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 28.10ms. Allocated memory is still 215.0MB. Free memory was 179.5MB in the beginning and 178.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 436287.94ms. Allocated memory was 215.0MB in the beginning and 335.5MB in the end (delta: 120.6MB). Free memory was 177.4MB in the beginning and 148.1MB in the end (delta: 29.2MB). Peak memory consumption was 150.6MB. 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: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; VAL [\old(counter)=52, counter=0] [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L26] CALL assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L26] RET assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [\old(counter)=0, A=1567505, counter=0, R=1253] [L28] CALL assume_abort_if_not(A % 2 == 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L28] RET assume_abort_if_not(A % 2 == 1) VAL [\old(counter)=0, A=1567505, counter=0, R=1253] [L30] u = ((long long) 2 * R) + 1 [L31] v = 1 [L32] r = ((long long) R * R) - A VAL [\old(counter)=0, A=1567505, counter=0, r=2504, R=1253, u=2507, v=1] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=1, counter++=0, R=1253, r=2504, u=2507, v=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=1, r=2504, R=1253, u=2507, v=1] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=1, R=1253, r=2504, u=2507, v=1] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=1, r=2503, R=1253, u=2507, v=3] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=2, counter++=1, R=1253, r=2503, u=2507, v=3] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=2, r=2503, R=1253, u=2507, v=3] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=2, R=1253, r=2503, u=2507, v=3] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=2, R=1253, r=2500, u=2507, v=5] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=3, counter++=2, R=1253, r=2500, u=2507, v=5] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=3, R=1253, r=2500, u=2507, v=5] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=3, R=1253, r=2500, u=2507, v=5] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=3, R=1253, r=2495, u=2507, v=7] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=4, counter++=3, R=1253, r=2495, u=2507, v=7] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=4, R=1253, r=2495, u=2507, v=7] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=4, R=1253, r=2495, u=2507, v=7] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=4, r=2488, R=1253, u=2507, v=9] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=5, counter++=4, r=2488, R=1253, u=2507, v=9] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=5, R=1253, r=2488, u=2507, v=9] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=5, r=2488, R=1253, u=2507, v=9] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=5, r=2479, R=1253, u=2507, v=11] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=6, counter++=5, R=1253, r=2479, u=2507, v=11] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=6, R=1253, r=2479, u=2507, v=11] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=6, R=1253, r=2479, u=2507, v=11] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=6, R=1253, r=2468, u=2507, v=13] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=7, counter++=6, R=1253, r=2468, u=2507, v=13] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=7, r=2468, R=1253, u=2507, v=13] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=7, R=1253, r=2468, u=2507, v=13] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=7, R=1253, r=2455, u=2507, v=15] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=8, counter++=7, R=1253, r=2455, u=2507, v=15] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=8, r=2455, R=1253, u=2507, v=15] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=8, R=1253, r=2455, u=2507, v=15] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=8, r=2440, R=1253, u=2507, v=17] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=9, counter++=8, r=2440, R=1253, u=2507, v=17] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=9, R=1253, r=2440, u=2507, v=17] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=9, r=2440, R=1253, u=2507, v=17] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=9, r=2423, R=1253, u=2507, v=19] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=10, counter++=9, r=2423, R=1253, u=2507, v=19] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=10, r=2423, R=1253, u=2507, v=19] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=10, R=1253, r=2423, u=2507, v=19] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=10, r=2404, R=1253, u=2507, v=21] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=11, counter++=10, r=2404, R=1253, u=2507, v=21] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=11, r=2404, R=1253, u=2507, v=21] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=11, R=1253, r=2404, u=2507, v=21] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=11, R=1253, r=2383, u=2507, v=23] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=12, counter++=11, r=2383, R=1253, u=2507, v=23] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=12, R=1253, r=2383, u=2507, v=23] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=12, r=2383, R=1253, u=2507, v=23] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=12, r=2360, R=1253, u=2507, v=25] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=13, counter++=12, R=1253, r=2360, u=2507, v=25] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=13, r=2360, R=1253, u=2507, v=25] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=13, r=2360, R=1253, u=2507, v=25] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=13, r=2335, R=1253, u=2507, v=27] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=14, counter++=13, R=1253, r=2335, u=2507, v=27] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=14, R=1253, r=2335, u=2507, v=27] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=14, R=1253, r=2335, u=2507, v=27] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=14, r=2308, R=1253, u=2507, v=29] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=15, counter++=14, r=2308, R=1253, u=2507, v=29] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=15, R=1253, r=2308, u=2507, v=29] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=15, r=2308, R=1253, u=2507, v=29] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=15, r=2279, R=1253, u=2507, v=31] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=16, counter++=15, R=1253, r=2279, u=2507, v=31] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=16, r=2279, R=1253, u=2507, v=31] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=16, R=1253, r=2279, u=2507, v=31] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=16, r=2248, R=1253, u=2507, v=33] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=17, counter++=16, R=1253, r=2248, u=2507, v=33] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=17, R=1253, r=2248, u=2507, v=33] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=17, R=1253, r=2248, u=2507, v=33] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=17, R=1253, r=2215, u=2507, v=35] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=18, counter++=17, R=1253, r=2215, u=2507, v=35] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=18, r=2215, R=1253, u=2507, v=35] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=18, R=1253, r=2215, u=2507, v=35] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=18, r=2180, R=1253, u=2507, v=37] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=19, counter++=18, R=1253, r=2180, u=2507, v=37] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=19, r=2180, R=1253, u=2507, v=37] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=19, r=2180, R=1253, u=2507, v=37] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=19, r=2143, R=1253, u=2507, v=39] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=20, counter++=19, r=2143, R=1253, u=2507, v=39] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=20, r=2143, R=1253, u=2507, v=39] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=20, R=1253, r=2143, u=2507, v=39] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=20, r=2104, R=1253, u=2507, v=41] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=21, counter++=20, r=2104, R=1253, u=2507, v=41] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=21] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=21] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=21, r=2104, R=1253, u=2507, v=41] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=21, r=2104, R=1253, u=2507, v=41] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=21, R=1253, r=2063, u=2507, v=43] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=22, counter++=21, r=2063, R=1253, u=2507, v=43] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=22] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=22] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=22, R=1253, r=2063, u=2507, v=43] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=22, R=1253, r=2063, u=2507, v=43] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=22, r=2020, R=1253, u=2507, v=45] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=23, counter++=22, R=1253, r=2020, u=2507, v=45] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=23] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=23] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=23, R=1253, r=2020, u=2507, v=45] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=23, R=1253, r=2020, u=2507, v=45] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=23, R=1253, r=1975, u=2507, v=47] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=24, counter++=23, r=1975, R=1253, u=2507, v=47] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=24] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=24] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=24, R=1253, r=1975, u=2507, v=47] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=24, R=1253, r=1975, u=2507, v=47] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=24, R=1253, r=1928, u=2507, v=49] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=25, counter++=24, r=1928, R=1253, u=2507, v=49] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=25] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=25] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=25, R=1253, r=1928, u=2507, v=49] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=25, r=1928, R=1253, u=2507, v=49] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=25, R=1253, r=1879, u=2507, v=51] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=26, counter++=25, R=1253, r=1879, u=2507, v=51] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=26] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=26] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=26, R=1253, r=1879, u=2507, v=51] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=26, R=1253, r=1879, u=2507, v=51] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=26, r=1828, R=1253, u=2507, v=53] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=27, counter++=26, R=1253, r=1828, u=2507, v=53] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=27] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=27] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=27, r=1828, R=1253, u=2507, v=53] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=27, R=1253, r=1828, u=2507, v=53] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=27, R=1253, r=1775, u=2507, v=55] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=28, counter++=27, R=1253, r=1775, u=2507, v=55] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=28] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=28] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=28, R=1253, r=1775, u=2507, v=55] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=28, r=1775, R=1253, u=2507, v=55] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=28, R=1253, r=1720, u=2507, v=57] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=29, counter++=28, R=1253, r=1720, u=2507, v=57] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=29] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=29] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=29, R=1253, r=1720, u=2507, v=57] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=29, R=1253, r=1720, u=2507, v=57] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=29, r=1663, R=1253, u=2507, v=59] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=30, counter++=29, R=1253, r=1663, u=2507, v=59] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=30] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=30] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=30, R=1253, r=1663, u=2507, v=59] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=30, R=1253, r=1663, u=2507, v=59] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=30, r=1604, R=1253, u=2507, v=61] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=31, counter++=30, r=1604, R=1253, u=2507, v=61] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=31] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=31] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=31, R=1253, r=1604, u=2507, v=61] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=31, R=1253, r=1604, u=2507, v=61] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=31, R=1253, r=1543, u=2507, v=63] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=32, counter++=31, R=1253, r=1543, u=2507, v=63] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=32] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=32] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=32, r=1543, R=1253, u=2507, v=63] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=32, R=1253, r=1543, u=2507, v=63] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=32, r=1480, R=1253, u=2507, v=65] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=33, counter++=32, r=1480, R=1253, u=2507, v=65] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=33] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=33] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=33, R=1253, r=1480, u=2507, v=65] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=33, r=1480, R=1253, u=2507, v=65] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=33, r=1415, R=1253, u=2507, v=67] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=34, counter++=33, R=1253, r=1415, u=2507, v=67] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=34] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=34] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=34, R=1253, r=1415, u=2507, v=67] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=34, R=1253, r=1415, u=2507, v=67] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=34, R=1253, r=1348, u=2507, v=69] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=35, counter++=34, R=1253, r=1348, u=2507, v=69] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=35] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=35] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=35, R=1253, r=1348, u=2507, v=69] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=35, R=1253, r=1348, u=2507, v=69] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=35, R=1253, r=1279, u=2507, v=71] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=36, counter++=35, r=1279, R=1253, u=2507, v=71] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=36] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=36] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=36, R=1253, r=1279, u=2507, v=71] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=36, R=1253, r=1279, u=2507, v=71] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=36, r=1208, R=1253, u=2507, v=73] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=37, counter++=36, r=1208, R=1253, u=2507, v=73] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=37] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=37] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=37, r=1208, R=1253, u=2507, v=73] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=37, r=1208, R=1253, u=2507, v=73] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=37, R=1253, r=1135, u=2507, v=75] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=38, counter++=37, R=1253, r=1135, u=2507, v=75] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=38] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=38] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=38, R=1253, r=1135, u=2507, v=75] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=38, R=1253, r=1135, u=2507, v=75] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=38, r=1060, R=1253, u=2507, v=77] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=39, counter++=38, r=1060, R=1253, u=2507, v=77] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=39] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=39] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=39, R=1253, r=1060, u=2507, v=77] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=39, R=1253, r=1060, u=2507, v=77] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=39, R=1253, r=983, u=2507, v=79] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=40, counter++=39, R=1253, r=983, u=2507, v=79] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=40] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=40] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=40, r=983, R=1253, u=2507, v=79] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=40, r=983, R=1253, u=2507, v=79] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=40, r=904, R=1253, u=2507, v=81] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=41, counter++=40, R=1253, r=904, u=2507, v=81] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=41] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=41] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=41, R=1253, r=904, u=2507, v=81] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=41, r=904, R=1253, u=2507, v=81] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=41, R=1253, r=823, u=2507, v=83] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=42, counter++=41, R=1253, r=823, u=2507, v=83] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=42] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=42] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=42, r=823, R=1253, u=2507, v=83] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=42, r=823, R=1253, u=2507, v=83] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=42, r=740, R=1253, u=2507, v=85] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=43, counter++=42, R=1253, r=740, u=2507, v=85] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=43] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=43] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=43, r=740, R=1253, u=2507, v=85] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=43, r=740, R=1253, u=2507, v=85] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=43, R=1253, r=655, u=2507, v=87] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=44, counter++=43, r=655, R=1253, u=2507, v=87] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=44] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=44] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=44, R=1253, r=655, u=2507, v=87] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=44, r=655, R=1253, u=2507, v=87] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=44, r=568, R=1253, u=2507, v=89] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=45, counter++=44, r=568, R=1253, u=2507, v=89] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=45] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=45] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=45, r=568, R=1253, u=2507, v=89] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=45, R=1253, r=568, u=2507, v=89] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=45, r=479, R=1253, u=2507, v=91] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=46, counter++=45, r=479, R=1253, u=2507, v=91] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=46] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=46] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=46, R=1253, r=479, u=2507, v=91] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=46, R=1253, r=479, u=2507, v=91] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=46, r=388, R=1253, u=2507, v=93] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=47, counter++=46, r=388, R=1253, u=2507, v=93] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=47] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=47] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=47, r=388, R=1253, u=2507, v=93] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=47, R=1253, r=388, u=2507, v=93] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=47, R=1253, r=295, u=2507, v=95] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=48, counter++=47, R=1253, r=295, u=2507, v=95] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=48] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=48] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=48, R=1253, r=295, u=2507, v=95] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=48, r=295, R=1253, u=2507, v=95] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=48, R=1253, r=200, u=2507, v=97] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=49, counter++=48, r=200, R=1253, u=2507, v=97] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=49] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=49] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=49, r=200, R=1253, u=2507, v=97] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=49, R=1253, r=200, u=2507, v=97] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=49, R=1253, r=103, u=2507, v=99] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=50, counter++=49, R=1253, r=103, u=2507, v=99] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=50] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=50] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=1567505, counter=50, R=1253, r=103, u=2507, v=99] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=1567505, counter=50, R=1253, r=103, u=2507, v=99] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [\old(counter)=0, A=1567505, counter=50, r=4, R=1253, u=2507, v=101] [L34] EXPR counter++ VAL [\old(counter)=0, A=1567505, counter=51, counter++=50, R=1253, r=4, u=2507, v=101] [L34] COND FALSE !(counter++<50) [L48] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, \old(counter)=0, counter=51] [L12] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=51] [L14] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 436.2s, OverallIterations: 10, TraceHistogramMax: 51, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 1424 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1423 mSDsluCounter, 1772 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1409 mSDsCounter, 448 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 942 IncrementalHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 448 mSolverCounterUnsat, 363 mSDtfsCounter, 942 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1972 GetRequests, 1684 SyntacticMatches, 2 SemanticMatches, 286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2921 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=470occurred in iteration=9, InterpolantAutomatonStates: 293, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 420.0s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 1432 NumberOfCodeBlocks, 1432 NumberOfCodeBlocksAsserted, 118 NumberOfCheckSat, 1835 ConstructedInterpolants, 0 QuantifiedInterpolants, 4655 SizeOfPredicates, 98 NumberOfNonLiveVariables, 2504 ConjunctsInSsa, 220 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 5662/24434 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-06 07:06:14,079 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...