/usr/bin/java -ea -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/loops-crafted-1/sum_natnum.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 16:58:28,064 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 16:58:28,065 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 16:58:28,122 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 16:58:28,122 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 16:58:28,123 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 16:58:28,124 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 16:58:28,124 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 16:58:28,125 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 16:58:28,126 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 16:58:28,126 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 16:58:28,127 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 16:58:28,127 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 16:58:28,128 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 16:58:28,129 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 16:58:28,129 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 16:58:28,130 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 16:58:28,130 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 16:58:28,131 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 16:58:28,132 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 16:58:28,133 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 16:58:28,137 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 16:58:28,138 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 16:58:28,138 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 16:58:28,139 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 16:58:28,141 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 16:58:28,141 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 16:58:28,141 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 16:58:28,142 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 16:58:28,142 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 16:58:28,142 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 16:58:28,143 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 16:58:28,143 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 16:58:28,144 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 16:58:28,144 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 16:58:28,145 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 16:58:28,145 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 16:58:28,145 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 16:58:28,145 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 16:58:28,145 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 16:58:28,146 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 16:58:28,146 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 16:58:28,147 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 16:58:28,153 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 16:58:28,153 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 16:58:28,153 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 16:58:28,154 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 16:58:28,154 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 16:58:28,154 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 16:58:28,154 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 16:58:28,154 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 16:58:28,154 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 16:58:28,154 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 16:58:28,154 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 16:58:28,155 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 16:58:28,155 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 16:58:28,155 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 16:58:28,155 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 16:58:28,155 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 16:58:28,155 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 16:58:28,155 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 16:58:28,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:58:28,156 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 16:58:28,156 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 16:58:28,156 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 16:58:28,156 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-27 16:58:28,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 16:58:28,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 16:58:28,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 16:58:28,365 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 16:58:28,367 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 16:58:28,368 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sum_natnum.c [2022-04-27 16:58:28,408 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff2e68dd7/9d78bc9ea3444b4d98c9edccd3c7d0e0/FLAG8763eb3a1 [2022-04-27 16:58:28,710 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 16:58:28,711 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sum_natnum.c [2022-04-27 16:58:28,722 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff2e68dd7/9d78bc9ea3444b4d98c9edccd3c7d0e0/FLAG8763eb3a1 [2022-04-27 16:58:29,141 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff2e68dd7/9d78bc9ea3444b4d98c9edccd3c7d0e0 [2022-04-27 16:58:29,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 16:58:29,145 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 16:58:29,147 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 16:58:29,147 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 16:58:29,149 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 16:58:29,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:58:29" (1/1) ... [2022-04-27 16:58:29,151 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ad09bc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:58:29, skipping insertion in model container [2022-04-27 16:58:29,151 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:58:29" (1/1) ... [2022-04-27 16:58:29,155 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 16:58:29,162 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 16:58:29,268 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sum_natnum.c[458,471] [2022-04-27 16:58:29,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:58:29,281 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 16:58:29,288 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sum_natnum.c[458,471] [2022-04-27 16:58:29,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:58:29,298 INFO L208 MainTranslator]: Completed translation [2022-04-27 16:58:29,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:58:29 WrapperNode [2022-04-27 16:58:29,299 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 16:58:29,299 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 16:58:29,299 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 16:58:29,300 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 16:58:29,307 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:58:29" (1/1) ... [2022-04-27 16:58:29,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:58:29" (1/1) ... [2022-04-27 16:58:29,310 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:58:29" (1/1) ... [2022-04-27 16:58:29,311 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:58:29" (1/1) ... [2022-04-27 16:58:29,314 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:58:29" (1/1) ... [2022-04-27 16:58:29,316 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:58:29" (1/1) ... [2022-04-27 16:58:29,317 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:58:29" (1/1) ... [2022-04-27 16:58:29,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 16:58:29,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 16:58:29,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 16:58:29,318 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 16:58:29,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:58:29" (1/1) ... [2022-04-27 16:58:29,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:58:29,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:58:29,337 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-27 16:58:29,347 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-27 16:58:29,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 16:58:29,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 16:58:29,371 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 16:58:29,371 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 16:58:29,372 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 16:58:29,372 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 16:58:29,372 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 16:58:29,372 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 16:58:29,373 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 16:58:29,373 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 16:58:29,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 16:58:29,373 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 16:58:29,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 16:58:29,373 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 16:58:29,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 16:58:29,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 16:58:29,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 16:58:29,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 16:58:29,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 16:58:29,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 16:58:29,417 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 16:58:29,418 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 16:58:29,506 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 16:58:29,511 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 16:58:29,511 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 16:58:29,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:58:29 BoogieIcfgContainer [2022-04-27 16:58:29,512 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 16:58:29,513 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 16:58:29,513 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 16:58:29,513 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 16:58:29,515 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:58:29" (1/1) ... [2022-04-27 16:58:29,516 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 16:58:33,219 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-27 16:58:33,220 INFO L91 elerationTransformer]: Accelerated Formula: (and (< v_main_~i~0_3 v_~SIZE~0_2) (= (+ v_main_~i~0_2 v_main_~sum~0_2) v_main_~sum~0_1) (= v_main_~i~0_2 (+ v_main_~i~0_3 1))) InVars {~SIZE~0=v_~SIZE~0_2, main_~sum~0=v_main_~sum~0_2, main_~i~0=v_main_~i~0_3} OutVars{~SIZE~0=v_~SIZE~0_2, main_~sum~0=v_main_~sum~0_1, main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] to Formula: (let ((.cse1 (* (- 1) v_main_~i~0_3)) (.cse2 (* (- 1) v_main_~i~0_2))) (or (let ((.cse0 (div (+ .cse2 v_main_~i~0_3 1) (- 2)))) (and (= (mod (+ v_main_~i~0_3 v_main_~i~0_2 1) 2) 0) (= (+ v_main_~i~0_3 (* (* .cse0 .cse0) 2) (* .cse0 3) (* 2 (* .cse0 v_main_~i~0_3)) v_main_~sum~0_2 1) v_main_~sum~0_1) (< .cse0 (+ (div (+ (- 1) v_~SIZE~0_2 .cse1) 2) 1)) (<= 0 .cse0))) (and (not (< v_main_~i~0_3 v_~SIZE~0_2)) (= v_main_~sum~0_2 v_main_~sum~0_1) (= v_main_~i~0_3 v_main_~i~0_2)) (let ((.cse3 (div (+ .cse2 v_main_~i~0_3) (- 2)))) (and (< 0 .cse3) (< .cse3 (+ 2 (div (+ v_~SIZE~0_2 (- 2) .cse1) 2))) (= (mod (+ v_main_~i~0_3 v_main_~i~0_2) 2) 0) (= (+ .cse3 (* (* .cse3 .cse3) 2) (* 2 (* v_main_~i~0_3 .cse3)) v_main_~sum~0_2) v_main_~sum~0_1))))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_3, main_~sum~0=v_main_~sum~0_2} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_~sum~0=v_main_~sum~0_1} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] [2022-04-27 16:58:33,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:58:33 BasicIcfg [2022-04-27 16:58:33,224 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 16:58:33,225 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 16:58:33,225 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 16:58:33,230 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 16:58:33,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 04:58:29" (1/4) ... [2022-04-27 16:58:33,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36e1f4f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:58:33, skipping insertion in model container [2022-04-27 16:58:33,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:58:29" (2/4) ... [2022-04-27 16:58:33,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36e1f4f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:58:33, skipping insertion in model container [2022-04-27 16:58:33,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:58:29" (3/4) ... [2022-04-27 16:58:33,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36e1f4f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:58:33, skipping insertion in model container [2022-04-27 16:58:33,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:58:33" (4/4) ... [2022-04-27 16:58:33,232 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_natnum.cJordan [2022-04-27 16:58:33,240 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 16:58:33,240 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 16:58:33,274 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 16:58:33,278 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@533777fa, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@44eed2ea [2022-04-27 16:58:33,278 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 16:58:33,285 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:58:33,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 16:58:33,289 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:58:33,289 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:58:33,289 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:58:33,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:58:33,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1627068025, now seen corresponding path program 1 times [2022-04-27 16:58:33,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:58:33,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313669162] [2022-04-27 16:58:33,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:58:33,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:58:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:58:33,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:58:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:58:33,413 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~SIZE~0_4 40000) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {22#true} is VALID [2022-04-27 16:58:33,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-27 16:58:33,414 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-27 16:58:33,415 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:58:33,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~SIZE~0_4 40000) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {22#true} is VALID [2022-04-27 16:58:33,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-27 16:58:33,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-27 16:58:33,416 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-27 16:58:33,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} [52] mainENTRY-->L23-2: Formula: (and (= 0 v_main_~sum~0_4) (= v_main_~i~0_4 0)) InVars {} OutVars{main_~i~0=v_main_~i~0_4, main_~sum~0=v_main_~sum~0_4} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {22#true} is VALID [2022-04-27 16:58:33,420 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#true} [54] L23-2-->L23-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {23#false} is VALID [2022-04-27 16:58:33,420 INFO L272 TraceCheckUtils]: 7: Hoare triple {23#false} [57] L23-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_~SIZE~0_7 (+ v_~SIZE~0_7 1)))) (let ((.cse1 (div .cse0 2))) (ite (and (not (= (mod .cse0 2) 0)) (< (+ v_~SIZE~0_7 (* v_~SIZE~0_7 v_~SIZE~0_7)) 0)) (+ .cse1 1) .cse1))) 18446744073709551616) (mod v_main_~sum~0_7 18446744073709551616)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {~SIZE~0=v_~SIZE~0_7, main_~sum~0=v_main_~sum~0_7} OutVars{~SIZE~0=v_~SIZE~0_7, __VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sum~0] {23#false} is VALID [2022-04-27 16:58:33,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} [59] __VERIFIER_assertENTRY-->L13: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {23#false} is VALID [2022-04-27 16:58:33,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} [61] L13-->L14: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {23#false} is VALID [2022-04-27 16:58:33,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} [63] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#false} is VALID [2022-04-27 16:58:33,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:58:33,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:58:33,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313669162] [2022-04-27 16:58:33,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313669162] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:58:33,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:58:33,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 16:58:33,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772632399] [2022-04-27 16:58:33,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:58:33,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 16:58:33,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:58:33,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:58:33,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:58:33,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 16:58:33,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:58:33,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 16:58:33,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:58:33,470 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:58:35,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:58:35,526 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-27 16:58:35,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 16:58:35,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 16:58:35,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:58:35,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:58:35,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2022-04-27 16:58:35,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:58:35,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2022-04-27 16:58:35,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 21 transitions. [2022-04-27 16:58:35,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:58:35,564 INFO L225 Difference]: With dead ends: 19 [2022-04-27 16:58:35,564 INFO L226 Difference]: Without dead ends: 12 [2022-04-27 16:58:35,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:58:35,567 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 10 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:58:35,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 19 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:58:35,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-04-27 16:58:35,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-04-27 16:58:35,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:58:35,583 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:58:35,583 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:58:35,583 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:58:35,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:58:35,585 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-27 16:58:35,585 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 16:58:35,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:58:35,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:58:35,585 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-27 16:58:35,585 INFO L87 Difference]: Start difference. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-27 16:58:35,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:58:35,590 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-27 16:58:35,590 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 16:58:35,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:58:35,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:58:35,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:58:35,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:58:35,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:58:35,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-27 16:58:35,593 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2022-04-27 16:58:35,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:58:35,594 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-27 16:58:35,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:58:35,595 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 16:58:35,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 16:58:35,598 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:58:35,599 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:58:35,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 16:58:35,601 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:58:35,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:58:35,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1626144504, now seen corresponding path program 1 times [2022-04-27 16:58:35,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:58:35,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717578867] [2022-04-27 16:58:35,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:58:35,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:58:35,630 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 16:58:35,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [44725346] [2022-04-27 16:58:35,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:58:35,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:58:35,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:58:35,632 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-27 16:58:35,650 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-27 16:58:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:58:35,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 16:58:35,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:58:35,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:58:35,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {85#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85#true} is VALID [2022-04-27 16:58:35,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {85#true} [50] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~SIZE~0_4 40000) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {93#(<= 40000 ~SIZE~0)} is VALID [2022-04-27 16:58:35,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {93#(<= 40000 ~SIZE~0)} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93#(<= 40000 ~SIZE~0)} is VALID [2022-04-27 16:58:35,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {93#(<= 40000 ~SIZE~0)} {85#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93#(<= 40000 ~SIZE~0)} is VALID [2022-04-27 16:58:35,782 INFO L272 TraceCheckUtils]: 4: Hoare triple {93#(<= 40000 ~SIZE~0)} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93#(<= 40000 ~SIZE~0)} is VALID [2022-04-27 16:58:35,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {93#(<= 40000 ~SIZE~0)} [52] mainENTRY-->L23-2: Formula: (and (= 0 v_main_~sum~0_4) (= v_main_~i~0_4 0)) InVars {} OutVars{main_~i~0=v_main_~i~0_4, main_~sum~0=v_main_~sum~0_4} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {106#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-27 16:58:35,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {106#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [55] L23-2-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {86#false} is VALID [2022-04-27 16:58:35,783 INFO L272 TraceCheckUtils]: 7: Hoare triple {86#false} [57] L23-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_~SIZE~0_7 (+ v_~SIZE~0_7 1)))) (let ((.cse1 (div .cse0 2))) (ite (and (not (= (mod .cse0 2) 0)) (< (+ v_~SIZE~0_7 (* v_~SIZE~0_7 v_~SIZE~0_7)) 0)) (+ .cse1 1) .cse1))) 18446744073709551616) (mod v_main_~sum~0_7 18446744073709551616)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {~SIZE~0=v_~SIZE~0_7, main_~sum~0=v_main_~sum~0_7} OutVars{~SIZE~0=v_~SIZE~0_7, __VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sum~0] {86#false} is VALID [2022-04-27 16:58:35,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {86#false} [59] __VERIFIER_assertENTRY-->L13: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {86#false} is VALID [2022-04-27 16:58:35,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {86#false} [61] L13-->L14: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {86#false} is VALID [2022-04-27 16:58:35,784 INFO L290 TraceCheckUtils]: 10: Hoare triple {86#false} [63] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {86#false} is VALID [2022-04-27 16:58:35,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:58:35,784 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 16:58:35,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:58:35,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717578867] [2022-04-27 16:58:35,785 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 16:58:35,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44725346] [2022-04-27 16:58:35,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44725346] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:58:35,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:58:35,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 16:58:35,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342416853] [2022-04-27 16:58:35,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:58:35,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 16:58:35,786 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:58:35,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:58:35,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:58:35,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 16:58:35,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:58:35,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 16:58:35,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-27 16:58:35,795 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:58:39,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:58:39,841 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 16:58:39,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 16:58:39,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 16:58:39,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:58:39,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:58:39,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2022-04-27 16:58:39,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:58:39,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2022-04-27 16:58:39,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 14 transitions. [2022-04-27 16:58:39,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:58:39,860 INFO L225 Difference]: With dead ends: 13 [2022-04-27 16:58:39,860 INFO L226 Difference]: Without dead ends: 13 [2022-04-27 16:58:39,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-27 16:58:39,861 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:58:39,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 16 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:58:39,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-27 16:58:39,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-27 16:58:39,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:58:39,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:58:39,864 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:58:39,864 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:58:39,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:58:39,865 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 16:58:39,865 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 16:58:39,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:58:39,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:58:39,865 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-27 16:58:39,865 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-27 16:58:39,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:58:39,866 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 16:58:39,866 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 16:58:39,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:58:39,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:58:39,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:58:39,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:58:39,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:58:39,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-27 16:58:39,868 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-27 16:58:39,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:58:39,868 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-27 16:58:39,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:58:39,868 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 16:58:39,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 16:58:39,869 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:58:39,869 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:58:39,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 16:58:40,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:58:40,084 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:58:40,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:58:40,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1155848534, now seen corresponding path program 1 times [2022-04-27 16:58:40,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:58:40,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451239164] [2022-04-27 16:58:40,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:58:40,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:58:40,097 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 16:58:40,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [537045181] [2022-04-27 16:58:40,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:58:40,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:58:40,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:58:40,099 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-27 16:58:40,100 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-27 16:58:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:58:40,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 16:58:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:58:40,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:59:19,442 INFO L272 TraceCheckUtils]: 0: Hoare triple {173#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-27 16:59:19,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#true} [50] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~SIZE~0_4 40000) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {181#(= ~SIZE~0 40000)} is VALID [2022-04-27 16:59:19,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {181#(= ~SIZE~0 40000)} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#(= ~SIZE~0 40000)} is VALID [2022-04-27 16:59:19,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {181#(= ~SIZE~0 40000)} {173#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#(= ~SIZE~0 40000)} is VALID [2022-04-27 16:59:19,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {181#(= ~SIZE~0 40000)} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#(= ~SIZE~0 40000)} is VALID [2022-04-27 16:59:19,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {181#(= ~SIZE~0 40000)} [52] mainENTRY-->L23-2: Formula: (and (= 0 v_main_~sum~0_4) (= v_main_~i~0_4 0)) InVars {} OutVars{main_~i~0=v_main_~i~0_4, main_~sum~0=v_main_~sum~0_4} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {194#(and (= ~SIZE~0 40000) (= main_~sum~0 0) (= main_~i~0 0))} is VALID [2022-04-27 16:59:19,446 INFO L290 TraceCheckUtils]: 6: Hoare triple {194#(and (= ~SIZE~0 40000) (= main_~sum~0 0) (= main_~i~0 0))} [56] L23-2-->L23-2: Formula: (let ((.cse1 (* (- 1) v_main_~i~0_3)) (.cse2 (* (- 1) v_main_~i~0_2))) (or (let ((.cse0 (div (+ .cse2 v_main_~i~0_3 1) (- 2)))) (and (= (mod (+ v_main_~i~0_3 v_main_~i~0_2 1) 2) 0) (= (+ v_main_~i~0_3 (* (* .cse0 .cse0) 2) (* .cse0 3) (* 2 (* .cse0 v_main_~i~0_3)) v_main_~sum~0_2 1) v_main_~sum~0_1) (< .cse0 (+ (div (+ (- 1) v_~SIZE~0_2 .cse1) 2) 1)) (<= 0 .cse0))) (and (not (< v_main_~i~0_3 v_~SIZE~0_2)) (= v_main_~sum~0_2 v_main_~sum~0_1) (= v_main_~i~0_3 v_main_~i~0_2)) (let ((.cse3 (div (+ .cse2 v_main_~i~0_3) (- 2)))) (and (< 0 .cse3) (< .cse3 (+ 2 (div (+ v_~SIZE~0_2 (- 2) .cse1) 2))) (= (mod (+ v_main_~i~0_3 v_main_~i~0_2) 2) 0) (= (+ .cse3 (* (* .cse3 .cse3) 2) (* 2 (* v_main_~i~0_3 .cse3)) v_main_~sum~0_2) v_main_~sum~0_1))))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_3, main_~sum~0=v_main_~sum~0_2} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_~sum~0=v_main_~sum~0_1} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {198#(and (= ~SIZE~0 40000) (or (and (= 0 (mod main_~i~0 2)) (< (div (* (- 1) main_~i~0) (- 2)) (+ (div (+ ~SIZE~0 (- 2)) 2) 2)) (< 0 (div (* (- 1) main_~i~0) (- 2))) (= (+ (* (* (div (* (- 1) main_~i~0) (- 2)) (div (* (- 1) main_~i~0) (- 2))) 2) (div (* (- 1) main_~i~0) (- 2))) main_~sum~0)) (and (< (div (+ (* (- 1) main_~i~0) 1) (- 2)) (+ (div (+ (- 1) ~SIZE~0) 2) 1)) (<= 0 (div (+ (* (- 1) main_~i~0) 1) (- 2))) (= (+ (* 3 (div (+ (* (- 1) main_~i~0) 1) (- 2))) (* 2 (* (div (+ (* (- 1) main_~i~0) 1) (- 2)) (div (+ (* (- 1) main_~i~0) 1) (- 2)))) 1) main_~sum~0) (= (mod (+ main_~i~0 1) 2) 0))))} is VALID [2022-04-27 16:59:19,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {198#(and (= ~SIZE~0 40000) (or (and (= 0 (mod main_~i~0 2)) (< (div (* (- 1) main_~i~0) (- 2)) (+ (div (+ ~SIZE~0 (- 2)) 2) 2)) (< 0 (div (* (- 1) main_~i~0) (- 2))) (= (+ (* (* (div (* (- 1) main_~i~0) (- 2)) (div (* (- 1) main_~i~0) (- 2))) 2) (div (* (- 1) main_~i~0) (- 2))) main_~sum~0)) (and (< (div (+ (* (- 1) main_~i~0) 1) (- 2)) (+ (div (+ (- 1) ~SIZE~0) 2) 1)) (<= 0 (div (+ (* (- 1) main_~i~0) 1) (- 2))) (= (+ (* 3 (div (+ (* (- 1) main_~i~0) 1) (- 2))) (* 2 (* (div (+ (* (- 1) main_~i~0) 1) (- 2)) (div (+ (* (- 1) main_~i~0) 1) (- 2)))) 1) main_~sum~0) (= (mod (+ main_~i~0 1) 2) 0))))} [55] L23-2-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {202#(and (= ~SIZE~0 40000) (exists ((aux_div_main_~i~0_17 Int)) (and (= (+ (* 2 (* (div (* (- 2) aux_div_main_~i~0_17) (- 2)) (div (* (- 2) aux_div_main_~i~0_17) (- 2)))) (div (* (- 2) aux_div_main_~i~0_17) (- 2))) main_~sum~0) (< aux_div_main_~i~0_17 (+ (div (+ ~SIZE~0 (- 2)) 2) 2)) (<= ~SIZE~0 (* 2 aux_div_main_~i~0_17)))))} is VALID [2022-04-27 16:59:19,450 INFO L272 TraceCheckUtils]: 8: Hoare triple {202#(and (= ~SIZE~0 40000) (exists ((aux_div_main_~i~0_17 Int)) (and (= (+ (* 2 (* (div (* (- 2) aux_div_main_~i~0_17) (- 2)) (div (* (- 2) aux_div_main_~i~0_17) (- 2)))) (div (* (- 2) aux_div_main_~i~0_17) (- 2))) main_~sum~0) (< aux_div_main_~i~0_17 (+ (div (+ ~SIZE~0 (- 2)) 2) 2)) (<= ~SIZE~0 (* 2 aux_div_main_~i~0_17)))))} [57] L23-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_~SIZE~0_7 (+ v_~SIZE~0_7 1)))) (let ((.cse1 (div .cse0 2))) (ite (and (not (= (mod .cse0 2) 0)) (< (+ v_~SIZE~0_7 (* v_~SIZE~0_7 v_~SIZE~0_7)) 0)) (+ .cse1 1) .cse1))) 18446744073709551616) (mod v_main_~sum~0_7 18446744073709551616)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {~SIZE~0=v_~SIZE~0_7, main_~sum~0=v_main_~sum~0_7} OutVars{~SIZE~0=v_~SIZE~0_7, __VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sum~0] {206#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:59:19,453 INFO L290 TraceCheckUtils]: 9: Hoare triple {206#(<= 1 |__VERIFIER_assert_#in~cond|)} [59] __VERIFIER_assertENTRY-->L13: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {210#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:59:19,453 INFO L290 TraceCheckUtils]: 10: Hoare triple {210#(<= 1 __VERIFIER_assert_~cond)} [61] L13-->L14: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {174#false} is VALID [2022-04-27 16:59:19,454 INFO L290 TraceCheckUtils]: 11: Hoare triple {174#false} [63] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {174#false} is VALID [2022-04-27 16:59:19,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:59:19,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:59:50,732 WARN L232 SmtUtils]: Spent 10.70s on a formula simplification. DAG size of input: 9 DAG size of output: 1 (called from [L 988] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-04-27 17:00:13,765 WARN L232 SmtUtils]: Spent 23.03s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 988] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-04-27 17:00:44,854 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (* (- 1) c_main_~i~0))) (let ((.cse6 (div (+ (- 2) .cse12 c_~SIZE~0) 2)) (.cse5 (div (+ (- 1) .cse12 c_~SIZE~0) 2))) (and (or (let ((.cse0 (* (- 1) c_main_~sum~0)) (.cse1 (mod (div (* (+ c_~SIZE~0 1) c_~SIZE~0) 2) 18446744073709551616))) (and (<= (div (+ .cse0 (- 1)) (- 18446744073709551616)) (div (+ .cse0 (- 1) .cse1) (- 18446744073709551616))) (<= (div (+ .cse0 .cse1) (- 18446744073709551616)) (+ (div (+ (- 18446744073709551616) c_main_~sum~0) 18446744073709551616) 1)))) (< c_main_~i~0 c_~SIZE~0)) (let ((.cse2 (+ .cse6 1))) (or (<= .cse2 0) (forall ((aux_div_v_main_~sum~0_9_42 Int) (aux_div_v_main_~i~0_8_49 Int)) (let ((.cse4 (+ (* (* aux_div_v_main_~i~0_8_49 aux_div_v_main_~i~0_8_49) 2) (* 2 (* c_main_~i~0 aux_div_v_main_~i~0_8_49)) aux_div_v_main_~i~0_8_49 c_main_~sum~0)) (.cse3 (* aux_div_v_main_~sum~0_9_42 18446744073709551616))) (or (<= (+ 2 (div (+ (- 2) (* (- 1) c_main_~i~0) c_~SIZE~0) 2)) aux_div_v_main_~i~0_8_49) (<= (+ .cse3 18446744073709551616) .cse4) (< .cse4 .cse3) (< (+ c_main_~i~0 (* 2 aux_div_v_main_~i~0_8_49)) c_~SIZE~0) (= (+ (* aux_div_v_main_~sum~0_9_42 (- 18446744073709551616)) (* 2 aux_div_v_main_~i~0_8_49 aux_div_v_main_~i~0_8_49) (* c_main_~i~0 2 aux_div_v_main_~i~0_8_49) aux_div_v_main_~i~0_8_49 c_main_~sum~0) (mod (div (* (+ c_~SIZE~0 1) c_~SIZE~0) 2) 18446744073709551616))))) (<= .cse2 .cse5))) (or (forall ((aux_div_v_main_~i~0_8_51 Int) (aux_div_v_main_~sum~0_9_42 Int)) (let ((.cse10 (* aux_div_v_main_~sum~0_9_42 18446744073709551616)) (.cse7 (* (* c_main_~i~0 aux_div_v_main_~i~0_8_51) 2)) (.cse8 (* (* aux_div_v_main_~i~0_8_51 aux_div_v_main_~i~0_8_51) 2)) (.cse9 (* 3 aux_div_v_main_~i~0_8_51)) (.cse11 (* (- 1) c_main_~i~0))) (or (< (+ c_main_~i~0 .cse7 .cse8 .cse9 1 c_main_~sum~0) .cse10) (<= aux_div_v_main_~i~0_8_51 (div (+ (- 2) .cse11 c_~SIZE~0) 2)) (<= (+ .cse10 18446744073709551615) (+ c_main_~i~0 .cse7 .cse8 .cse9 c_main_~sum~0)) (= (+ c_main_~i~0 (* aux_div_v_main_~sum~0_9_42 (- 18446744073709551616)) (* 2 aux_div_v_main_~i~0_8_51 aux_div_v_main_~i~0_8_51) .cse9 (* c_main_~i~0 2 aux_div_v_main_~i~0_8_51) 1 c_main_~sum~0) (mod (div (* (+ c_~SIZE~0 1) c_~SIZE~0) 2) 18446744073709551616)) (<= (+ (div (+ (- 1) .cse11 c_~SIZE~0) 2) 1) aux_div_v_main_~i~0_8_51)))) (<= .cse5 .cse6) (<= (+ .cse5 1) 0))))) is different from false [2022-04-27 17:02:09,393 WARN L232 SmtUtils]: Spent 42.16s on a formula simplification. DAG size of input: 67 DAG size of output: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 17:03:55,994 INFO L290 TraceCheckUtils]: 11: Hoare triple {174#false} [63] L14-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {174#false} is VALID [2022-04-27 17:03:55,995 INFO L290 TraceCheckUtils]: 10: Hoare triple {210#(<= 1 __VERIFIER_assert_~cond)} [61] L13-->L14: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {174#false} is VALID [2022-04-27 17:03:55,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {206#(<= 1 |__VERIFIER_assert_#in~cond|)} [59] __VERIFIER_assertENTRY-->L13: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {210#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:03:55,997 INFO L272 TraceCheckUtils]: 8: Hoare triple {226#(= (mod (div (* ~SIZE~0 (+ ~SIZE~0 1)) 2) 18446744073709551616) (mod main_~sum~0 18446744073709551616))} [57] L23-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_~SIZE~0_7 (+ v_~SIZE~0_7 1)))) (let ((.cse1 (div .cse0 2))) (ite (and (not (= (mod .cse0 2) 0)) (< (+ v_~SIZE~0_7 (* v_~SIZE~0_7 v_~SIZE~0_7)) 0)) (+ .cse1 1) .cse1))) 18446744073709551616) (mod v_main_~sum~0_7 18446744073709551616)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {~SIZE~0=v_~SIZE~0_7, main_~sum~0=v_main_~sum~0_7} OutVars{~SIZE~0=v_~SIZE~0_7, __VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sum~0] {206#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 17:03:55,998 INFO L290 TraceCheckUtils]: 7: Hoare triple {230#(or (= (mod (div (* ~SIZE~0 (+ ~SIZE~0 1)) 2) 18446744073709551616) (mod main_~sum~0 18446744073709551616)) (< main_~i~0 ~SIZE~0))} [55] L23-2-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {226#(= (mod (div (* ~SIZE~0 (+ ~SIZE~0 1)) 2) 18446744073709551616) (mod main_~sum~0 18446744073709551616))} is VALID [2022-04-27 17:03:56,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {234#(and (or (<= (+ (div (+ ~SIZE~0 (* (- 1) main_~i~0) (- 2)) 2) 1) (div (+ (- 1) ~SIZE~0 (* (- 1) main_~i~0)) 2)) (<= (+ (div (+ ~SIZE~0 (* (- 1) main_~i~0) (- 2)) 2) 1) 0) (forall ((aux_div_v_main_~sum~0_9_42 Int) (aux_div_v_main_~i~0_8_49 Int)) (or (<= (+ (div (+ ~SIZE~0 (* (- 1) main_~i~0) (- 2)) 2) 2) aux_div_v_main_~i~0_8_49) (= (mod (div (* ~SIZE~0 (+ ~SIZE~0 1)) 2) 18446744073709551616) (+ (* aux_div_v_main_~sum~0_9_42 (- 18446744073709551616)) main_~sum~0 (* 2 aux_div_v_main_~i~0_8_49 aux_div_v_main_~i~0_8_49) aux_div_v_main_~i~0_8_49 (* main_~i~0 2 aux_div_v_main_~i~0_8_49))) (<= (+ (* aux_div_v_main_~sum~0_9_42 18446744073709551616) 18446744073709551616) (+ (* (* aux_div_v_main_~i~0_8_49 aux_div_v_main_~i~0_8_49) 2) main_~sum~0 aux_div_v_main_~i~0_8_49 (* 2 (* main_~i~0 aux_div_v_main_~i~0_8_49)))) (< (+ (* (* aux_div_v_main_~i~0_8_49 aux_div_v_main_~i~0_8_49) 2) main_~sum~0 aux_div_v_main_~i~0_8_49 (* 2 (* main_~i~0 aux_div_v_main_~i~0_8_49))) (* aux_div_v_main_~sum~0_9_42 18446744073709551616)) (< (+ (* 2 aux_div_v_main_~i~0_8_49) main_~i~0) ~SIZE~0)))) (or (<= (div (+ (- 1) ~SIZE~0 (* (- 1) main_~i~0)) 2) (div (+ ~SIZE~0 (* (- 1) main_~i~0) (- 2)) 2)) (forall ((aux_div_v_main_~i~0_8_51 Int) (aux_div_v_main_~sum~0_9_42 Int)) (or (<= (+ (div (+ (- 1) ~SIZE~0 (* (- 1) main_~i~0)) 2) 1) aux_div_v_main_~i~0_8_51) (= (mod (div (* ~SIZE~0 (+ ~SIZE~0 1)) 2) 18446744073709551616) (+ (* aux_div_v_main_~sum~0_9_42 (- 18446744073709551616)) main_~sum~0 (* 2 aux_div_v_main_~i~0_8_51 aux_div_v_main_~i~0_8_51) main_~i~0 (* 3 aux_div_v_main_~i~0_8_51) (* main_~i~0 2 aux_div_v_main_~i~0_8_51) 1)) (<= (+ (* aux_div_v_main_~sum~0_9_42 18446744073709551616) 18446744073709551615) (+ main_~sum~0 main_~i~0 (* (* aux_div_v_main_~i~0_8_51 aux_div_v_main_~i~0_8_51) 2) (* 3 aux_div_v_main_~i~0_8_51) (* 2 (* main_~i~0 aux_div_v_main_~i~0_8_51)))) (< (+ main_~sum~0 main_~i~0 (* (* aux_div_v_main_~i~0_8_51 aux_div_v_main_~i~0_8_51) 2) (* 3 aux_div_v_main_~i~0_8_51) (* 2 (* main_~i~0 aux_div_v_main_~i~0_8_51)) 1) (* aux_div_v_main_~sum~0_9_42 18446744073709551616)) (<= aux_div_v_main_~i~0_8_51 (div (+ ~SIZE~0 (* (- 1) main_~i~0) (- 2)) 2)))) (<= (+ (div (+ (- 1) ~SIZE~0 (* (- 1) main_~i~0)) 2) 1) 0)) (or (and (<= (div (+ (- 1) (* (- 1) main_~sum~0)) (- 18446744073709551616)) (div (+ (- 1) (mod (div (* ~SIZE~0 (+ ~SIZE~0 1)) 2) 18446744073709551616) (* (- 1) main_~sum~0)) (- 18446744073709551616))) (<= (div (+ (mod (div (* ~SIZE~0 (+ ~SIZE~0 1)) 2) 18446744073709551616) (* (- 1) main_~sum~0)) (- 18446744073709551616)) (+ (div (+ (- 18446744073709551616) main_~sum~0) 18446744073709551616) 1))) (< main_~i~0 ~SIZE~0)))} [56] L23-2-->L23-2: Formula: (let ((.cse1 (* (- 1) v_main_~i~0_3)) (.cse2 (* (- 1) v_main_~i~0_2))) (or (let ((.cse0 (div (+ .cse2 v_main_~i~0_3 1) (- 2)))) (and (= (mod (+ v_main_~i~0_3 v_main_~i~0_2 1) 2) 0) (= (+ v_main_~i~0_3 (* (* .cse0 .cse0) 2) (* .cse0 3) (* 2 (* .cse0 v_main_~i~0_3)) v_main_~sum~0_2 1) v_main_~sum~0_1) (< .cse0 (+ (div (+ (- 1) v_~SIZE~0_2 .cse1) 2) 1)) (<= 0 .cse0))) (and (not (< v_main_~i~0_3 v_~SIZE~0_2)) (= v_main_~sum~0_2 v_main_~sum~0_1) (= v_main_~i~0_3 v_main_~i~0_2)) (let ((.cse3 (div (+ .cse2 v_main_~i~0_3) (- 2)))) (and (< 0 .cse3) (< .cse3 (+ 2 (div (+ v_~SIZE~0_2 (- 2) .cse1) 2))) (= (mod (+ v_main_~i~0_3 v_main_~i~0_2) 2) 0) (= (+ .cse3 (* (* .cse3 .cse3) 2) (* 2 (* v_main_~i~0_3 .cse3)) v_main_~sum~0_2) v_main_~sum~0_1))))) InVars {~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_3, main_~sum~0=v_main_~sum~0_2} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_~sum~0=v_main_~sum~0_1} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {230#(or (= (mod (div (* ~SIZE~0 (+ ~SIZE~0 1)) 2) 18446744073709551616) (mod main_~sum~0 18446744073709551616)) (< main_~i~0 ~SIZE~0))} is VALID [2022-04-27 17:03:56,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {238#(and (or (< 0 ~SIZE~0) (<= 1 (div (+ (- 1) (mod (div (* ~SIZE~0 (+ ~SIZE~0 1)) 2) 18446744073709551616)) (- 18446744073709551616)))) (or (forall ((aux_div_v_main_~sum~0_9_42 Int) (aux_div_v_main_~i~0_8_49 Int)) (or (< (+ (* (* aux_div_v_main_~i~0_8_49 aux_div_v_main_~i~0_8_49) 2) aux_div_v_main_~i~0_8_49) (* aux_div_v_main_~sum~0_9_42 18446744073709551616)) (< (* 2 aux_div_v_main_~i~0_8_49) ~SIZE~0) (<= (+ (* aux_div_v_main_~sum~0_9_42 18446744073709551616) 18446744073709551616) (+ (* (* aux_div_v_main_~i~0_8_49 aux_div_v_main_~i~0_8_49) 2) aux_div_v_main_~i~0_8_49)) (= (+ (* aux_div_v_main_~sum~0_9_42 18446744073709551616) (mod (div (* ~SIZE~0 (+ ~SIZE~0 1)) 2) 18446744073709551616)) (+ (* (* aux_div_v_main_~i~0_8_49 aux_div_v_main_~i~0_8_49) 2) aux_div_v_main_~i~0_8_49)) (<= (+ (div (+ ~SIZE~0 (- 2)) 2) 2) aux_div_v_main_~i~0_8_49))) (<= (+ (div (+ ~SIZE~0 (- 2)) 2) 1) 0)) (or (forall ((aux_div_v_main_~i~0_8_51 Int) (aux_div_v_main_~sum~0_9_42 Int)) (or (<= aux_div_v_main_~i~0_8_51 (div (+ ~SIZE~0 (- 2)) 2)) (<= (+ (div (+ (- 1) ~SIZE~0) 2) 1) aux_div_v_main_~i~0_8_51) (< (+ (* (* aux_div_v_main_~i~0_8_51 aux_div_v_main_~i~0_8_51) 2) (* 3 aux_div_v_main_~i~0_8_51) 1) (* aux_div_v_main_~sum~0_9_42 18446744073709551616)) (= (+ (* aux_div_v_main_~sum~0_9_42 18446744073709551616) (mod (div (* ~SIZE~0 (+ ~SIZE~0 1)) 2) 18446744073709551616)) (+ (* (* aux_div_v_main_~i~0_8_51 aux_div_v_main_~i~0_8_51) 2) (* 3 aux_div_v_main_~i~0_8_51) 1)) (<= (+ (* aux_div_v_main_~sum~0_9_42 18446744073709551616) 18446744073709551615) (+ (* (* aux_div_v_main_~i~0_8_51 aux_div_v_main_~i~0_8_51) 2) (* 3 aux_div_v_main_~i~0_8_51))))) (<= (+ (div (+ (- 1) ~SIZE~0) 2) 1) 0)))} [52] mainENTRY-->L23-2: Formula: (and (= 0 v_main_~sum~0_4) (= v_main_~i~0_4 0)) InVars {} OutVars{main_~i~0=v_main_~i~0_4, main_~sum~0=v_main_~sum~0_4} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {234#(and (or (<= (+ (div (+ ~SIZE~0 (* (- 1) main_~i~0) (- 2)) 2) 1) (div (+ (- 1) ~SIZE~0 (* (- 1) main_~i~0)) 2)) (<= (+ (div (+ ~SIZE~0 (* (- 1) main_~i~0) (- 2)) 2) 1) 0) (forall ((aux_div_v_main_~sum~0_9_42 Int) (aux_div_v_main_~i~0_8_49 Int)) (or (<= (+ (div (+ ~SIZE~0 (* (- 1) main_~i~0) (- 2)) 2) 2) aux_div_v_main_~i~0_8_49) (= (mod (div (* ~SIZE~0 (+ ~SIZE~0 1)) 2) 18446744073709551616) (+ (* aux_div_v_main_~sum~0_9_42 (- 18446744073709551616)) main_~sum~0 (* 2 aux_div_v_main_~i~0_8_49 aux_div_v_main_~i~0_8_49) aux_div_v_main_~i~0_8_49 (* main_~i~0 2 aux_div_v_main_~i~0_8_49))) (<= (+ (* aux_div_v_main_~sum~0_9_42 18446744073709551616) 18446744073709551616) (+ (* (* aux_div_v_main_~i~0_8_49 aux_div_v_main_~i~0_8_49) 2) main_~sum~0 aux_div_v_main_~i~0_8_49 (* 2 (* main_~i~0 aux_div_v_main_~i~0_8_49)))) (< (+ (* (* aux_div_v_main_~i~0_8_49 aux_div_v_main_~i~0_8_49) 2) main_~sum~0 aux_div_v_main_~i~0_8_49 (* 2 (* main_~i~0 aux_div_v_main_~i~0_8_49))) (* aux_div_v_main_~sum~0_9_42 18446744073709551616)) (< (+ (* 2 aux_div_v_main_~i~0_8_49) main_~i~0) ~SIZE~0)))) (or (<= (div (+ (- 1) ~SIZE~0 (* (- 1) main_~i~0)) 2) (div (+ ~SIZE~0 (* (- 1) main_~i~0) (- 2)) 2)) (forall ((aux_div_v_main_~i~0_8_51 Int) (aux_div_v_main_~sum~0_9_42 Int)) (or (<= (+ (div (+ (- 1) ~SIZE~0 (* (- 1) main_~i~0)) 2) 1) aux_div_v_main_~i~0_8_51) (= (mod (div (* ~SIZE~0 (+ ~SIZE~0 1)) 2) 18446744073709551616) (+ (* aux_div_v_main_~sum~0_9_42 (- 18446744073709551616)) main_~sum~0 (* 2 aux_div_v_main_~i~0_8_51 aux_div_v_main_~i~0_8_51) main_~i~0 (* 3 aux_div_v_main_~i~0_8_51) (* main_~i~0 2 aux_div_v_main_~i~0_8_51) 1)) (<= (+ (* aux_div_v_main_~sum~0_9_42 18446744073709551616) 18446744073709551615) (+ main_~sum~0 main_~i~0 (* (* aux_div_v_main_~i~0_8_51 aux_div_v_main_~i~0_8_51) 2) (* 3 aux_div_v_main_~i~0_8_51) (* 2 (* main_~i~0 aux_div_v_main_~i~0_8_51)))) (< (+ main_~sum~0 main_~i~0 (* (* aux_div_v_main_~i~0_8_51 aux_div_v_main_~i~0_8_51) 2) (* 3 aux_div_v_main_~i~0_8_51) (* 2 (* main_~i~0 aux_div_v_main_~i~0_8_51)) 1) (* aux_div_v_main_~sum~0_9_42 18446744073709551616)) (<= aux_div_v_main_~i~0_8_51 (div (+ ~SIZE~0 (* (- 1) main_~i~0) (- 2)) 2)))) (<= (+ (div (+ (- 1) ~SIZE~0 (* (- 1) main_~i~0)) 2) 1) 0)) (or (and (<= (div (+ (- 1) (* (- 1) main_~sum~0)) (- 18446744073709551616)) (div (+ (- 1) (mod (div (* ~SIZE~0 (+ ~SIZE~0 1)) 2) 18446744073709551616) (* (- 1) main_~sum~0)) (- 18446744073709551616))) (<= (div (+ (mod (div (* ~SIZE~0 (+ ~SIZE~0 1)) 2) 18446744073709551616) (* (- 1) main_~sum~0)) (- 18446744073709551616)) (+ (div (+ (- 18446744073709551616) main_~sum~0) 18446744073709551616) 1))) (< main_~i~0 ~SIZE~0)))} is VALID [2022-04-27 17:03:56,132 INFO L272 TraceCheckUtils]: 4: Hoare triple {238#(and (or (< 0 ~SIZE~0) (<= 1 (div (+ (- 1) (mod (div (* ~SIZE~0 (+ ~SIZE~0 1)) 2) 18446744073709551616)) (- 18446744073709551616)))) (or (forall ((aux_div_v_main_~sum~0_9_42 Int) (aux_div_v_main_~i~0_8_49 Int)) (or (< (+ (* (* aux_div_v_main_~i~0_8_49 aux_div_v_main_~i~0_8_49) 2) aux_div_v_main_~i~0_8_49) (* aux_div_v_main_~sum~0_9_42 18446744073709551616)) (< (* 2 aux_div_v_main_~i~0_8_49) ~SIZE~0) (<= (+ (* aux_div_v_main_~sum~0_9_42 18446744073709551616) 18446744073709551616) (+ (* (* aux_div_v_main_~i~0_8_49 aux_div_v_main_~i~0_8_49) 2) aux_div_v_main_~i~0_8_49)) (= (+ (* aux_div_v_main_~sum~0_9_42 18446744073709551616) (mod (div (* ~SIZE~0 (+ ~SIZE~0 1)) 2) 18446744073709551616)) (+ (* (* aux_div_v_main_~i~0_8_49 aux_div_v_main_~i~0_8_49) 2) aux_div_v_main_~i~0_8_49)) (<= (+ (div (+ ~SIZE~0 (- 2)) 2) 2) aux_div_v_main_~i~0_8_49))) (<= (+ (div (+ ~SIZE~0 (- 2)) 2) 1) 0)) (or (forall ((aux_div_v_main_~i~0_8_51 Int) (aux_div_v_main_~sum~0_9_42 Int)) (or (<= aux_div_v_main_~i~0_8_51 (div (+ ~SIZE~0 (- 2)) 2)) (<= (+ (div (+ (- 1) ~SIZE~0) 2) 1) aux_div_v_main_~i~0_8_51) (< (+ (* (* aux_div_v_main_~i~0_8_51 aux_div_v_main_~i~0_8_51) 2) (* 3 aux_div_v_main_~i~0_8_51) 1) (* aux_div_v_main_~sum~0_9_42 18446744073709551616)) (= (+ (* aux_div_v_main_~sum~0_9_42 18446744073709551616) (mod (div (* ~SIZE~0 (+ ~SIZE~0 1)) 2) 18446744073709551616)) (+ (* (* aux_div_v_main_~i~0_8_51 aux_div_v_main_~i~0_8_51) 2) (* 3 aux_div_v_main_~i~0_8_51) 1)) (<= (+ (* aux_div_v_main_~sum~0_9_42 18446744073709551616) 18446744073709551615) (+ (* (* aux_div_v_main_~i~0_8_51 aux_div_v_main_~i~0_8_51) 2) (* 3 aux_div_v_main_~i~0_8_51))))) (<= (+ (div (+ (- 1) ~SIZE~0) 2) 1) 0)))} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {238#(and (or (< 0 ~SIZE~0) (<= 1 (div (+ (- 1) (mod (div (* ~SIZE~0 (+ ~SIZE~0 1)) 2) 18446744073709551616)) (- 18446744073709551616)))) (or (forall ((aux_div_v_main_~sum~0_9_42 Int) (aux_div_v_main_~i~0_8_49 Int)) (or (< (+ (* (* aux_div_v_main_~i~0_8_49 aux_div_v_main_~i~0_8_49) 2) aux_div_v_main_~i~0_8_49) (* aux_div_v_main_~sum~0_9_42 18446744073709551616)) (< (* 2 aux_div_v_main_~i~0_8_49) ~SIZE~0) (<= (+ (* aux_div_v_main_~sum~0_9_42 18446744073709551616) 18446744073709551616) (+ (* (* aux_div_v_main_~i~0_8_49 aux_div_v_main_~i~0_8_49) 2) aux_div_v_main_~i~0_8_49)) (= (+ (* aux_div_v_main_~sum~0_9_42 18446744073709551616) (mod (div (* ~SIZE~0 (+ ~SIZE~0 1)) 2) 18446744073709551616)) (+ (* (* aux_div_v_main_~i~0_8_49 aux_div_v_main_~i~0_8_49) 2) aux_div_v_main_~i~0_8_49)) (<= (+ (div (+ ~SIZE~0 (- 2)) 2) 2) aux_div_v_main_~i~0_8_49))) (<= (+ (div (+ ~SIZE~0 (- 2)) 2) 1) 0)) (or (forall ((aux_div_v_main_~i~0_8_51 Int) (aux_div_v_main_~sum~0_9_42 Int)) (or (<= aux_div_v_main_~i~0_8_51 (div (+ ~SIZE~0 (- 2)) 2)) (<= (+ (div (+ (- 1) ~SIZE~0) 2) 1) aux_div_v_main_~i~0_8_51) (< (+ (* (* aux_div_v_main_~i~0_8_51 aux_div_v_main_~i~0_8_51) 2) (* 3 aux_div_v_main_~i~0_8_51) 1) (* aux_div_v_main_~sum~0_9_42 18446744073709551616)) (= (+ (* aux_div_v_main_~sum~0_9_42 18446744073709551616) (mod (div (* ~SIZE~0 (+ ~SIZE~0 1)) 2) 18446744073709551616)) (+ (* (* aux_div_v_main_~i~0_8_51 aux_div_v_main_~i~0_8_51) 2) (* 3 aux_div_v_main_~i~0_8_51) 1)) (<= (+ (* aux_div_v_main_~sum~0_9_42 18446744073709551616) 18446744073709551615) (+ (* (* aux_div_v_main_~i~0_8_51 aux_div_v_main_~i~0_8_51) 2) (* 3 aux_div_v_main_~i~0_8_51))))) (<= (+ (div (+ (- 1) ~SIZE~0) 2) 1) 0)))} is VALID [2022-04-27 17:03:56,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {238#(and (or (< 0 ~SIZE~0) (<= 1 (div (+ (- 1) (mod (div (* ~SIZE~0 (+ ~SIZE~0 1)) 2) 18446744073709551616)) (- 18446744073709551616)))) (or (forall ((aux_div_v_main_~sum~0_9_42 Int) (aux_div_v_main_~i~0_8_49 Int)) (or (< (+ (* (* aux_div_v_main_~i~0_8_49 aux_div_v_main_~i~0_8_49) 2) aux_div_v_main_~i~0_8_49) (* aux_div_v_main_~sum~0_9_42 18446744073709551616)) (< (* 2 aux_div_v_main_~i~0_8_49) ~SIZE~0) (<= (+ (* aux_div_v_main_~sum~0_9_42 18446744073709551616) 18446744073709551616) (+ (* (* aux_div_v_main_~i~0_8_49 aux_div_v_main_~i~0_8_49) 2) aux_div_v_main_~i~0_8_49)) (= (+ (* aux_div_v_main_~sum~0_9_42 18446744073709551616) (mod (div (* ~SIZE~0 (+ ~SIZE~0 1)) 2) 18446744073709551616)) (+ (* (* aux_div_v_main_~i~0_8_49 aux_div_v_main_~i~0_8_49) 2) aux_div_v_main_~i~0_8_49)) (<= (+ (div (+ ~SIZE~0 (- 2)) 2) 2) aux_div_v_main_~i~0_8_49))) (<= (+ (div (+ ~SIZE~0 (- 2)) 2) 1) 0)) (or (forall ((aux_div_v_main_~i~0_8_51 Int) (aux_div_v_main_~sum~0_9_42 Int)) (or (<= aux_div_v_main_~i~0_8_51 (div (+ ~SIZE~0 (- 2)) 2)) (<= (+ (div (+ (- 1) ~SIZE~0) 2) 1) aux_div_v_main_~i~0_8_51) (< (+ (* (* aux_div_v_main_~i~0_8_51 aux_div_v_main_~i~0_8_51) 2) (* 3 aux_div_v_main_~i~0_8_51) 1) (* aux_div_v_main_~sum~0_9_42 18446744073709551616)) (= (+ (* aux_div_v_main_~sum~0_9_42 18446744073709551616) (mod (div (* ~SIZE~0 (+ ~SIZE~0 1)) 2) 18446744073709551616)) (+ (* (* aux_div_v_main_~i~0_8_51 aux_div_v_main_~i~0_8_51) 2) (* 3 aux_div_v_main_~i~0_8_51) 1)) (<= (+ (* aux_div_v_main_~sum~0_9_42 18446744073709551616) 18446744073709551615) (+ (* (* aux_div_v_main_~i~0_8_51 aux_div_v_main_~i~0_8_51) 2) (* 3 aux_div_v_main_~i~0_8_51))))) (<= (+ (div (+ (- 1) ~SIZE~0) 2) 1) 0)))} {173#true} [66] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {238#(and (or (< 0 ~SIZE~0) (<= 1 (div (+ (- 1) (mod (div (* ~SIZE~0 (+ ~SIZE~0 1)) 2) 18446744073709551616)) (- 18446744073709551616)))) (or (forall ((aux_div_v_main_~sum~0_9_42 Int) (aux_div_v_main_~i~0_8_49 Int)) (or (< (+ (* (* aux_div_v_main_~i~0_8_49 aux_div_v_main_~i~0_8_49) 2) aux_div_v_main_~i~0_8_49) (* aux_div_v_main_~sum~0_9_42 18446744073709551616)) (< (* 2 aux_div_v_main_~i~0_8_49) ~SIZE~0) (<= (+ (* aux_div_v_main_~sum~0_9_42 18446744073709551616) 18446744073709551616) (+ (* (* aux_div_v_main_~i~0_8_49 aux_div_v_main_~i~0_8_49) 2) aux_div_v_main_~i~0_8_49)) (= (+ (* aux_div_v_main_~sum~0_9_42 18446744073709551616) (mod (div (* ~SIZE~0 (+ ~SIZE~0 1)) 2) 18446744073709551616)) (+ (* (* aux_div_v_main_~i~0_8_49 aux_div_v_main_~i~0_8_49) 2) aux_div_v_main_~i~0_8_49)) (<= (+ (div (+ ~SIZE~0 (- 2)) 2) 2) aux_div_v_main_~i~0_8_49))) (<= (+ (div (+ ~SIZE~0 (- 2)) 2) 1) 0)) (or (forall ((aux_div_v_main_~i~0_8_51 Int) (aux_div_v_main_~sum~0_9_42 Int)) (or (<= aux_div_v_main_~i~0_8_51 (div (+ ~SIZE~0 (- 2)) 2)) (<= (+ (div (+ (- 1) ~SIZE~0) 2) 1) aux_div_v_main_~i~0_8_51) (< (+ (* (* aux_div_v_main_~i~0_8_51 aux_div_v_main_~i~0_8_51) 2) (* 3 aux_div_v_main_~i~0_8_51) 1) (* aux_div_v_main_~sum~0_9_42 18446744073709551616)) (= (+ (* aux_div_v_main_~sum~0_9_42 18446744073709551616) (mod (div (* ~SIZE~0 (+ ~SIZE~0 1)) 2) 18446744073709551616)) (+ (* (* aux_div_v_main_~i~0_8_51 aux_div_v_main_~i~0_8_51) 2) (* 3 aux_div_v_main_~i~0_8_51) 1)) (<= (+ (* aux_div_v_main_~sum~0_9_42 18446744073709551616) 18446744073709551615) (+ (* (* aux_div_v_main_~i~0_8_51 aux_div_v_main_~i~0_8_51) 2) (* 3 aux_div_v_main_~i~0_8_51))))) (<= (+ (div (+ (- 1) ~SIZE~0) 2) 1) 0)))} is VALID [2022-04-27 17:03:56,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {238#(and (or (< 0 ~SIZE~0) (<= 1 (div (+ (- 1) (mod (div (* ~SIZE~0 (+ ~SIZE~0 1)) 2) 18446744073709551616)) (- 18446744073709551616)))) (or (forall ((aux_div_v_main_~sum~0_9_42 Int) (aux_div_v_main_~i~0_8_49 Int)) (or (< (+ (* (* aux_div_v_main_~i~0_8_49 aux_div_v_main_~i~0_8_49) 2) aux_div_v_main_~i~0_8_49) (* aux_div_v_main_~sum~0_9_42 18446744073709551616)) (< (* 2 aux_div_v_main_~i~0_8_49) ~SIZE~0) (<= (+ (* aux_div_v_main_~sum~0_9_42 18446744073709551616) 18446744073709551616) (+ (* (* aux_div_v_main_~i~0_8_49 aux_div_v_main_~i~0_8_49) 2) aux_div_v_main_~i~0_8_49)) (= (+ (* aux_div_v_main_~sum~0_9_42 18446744073709551616) (mod (div (* ~SIZE~0 (+ ~SIZE~0 1)) 2) 18446744073709551616)) (+ (* (* aux_div_v_main_~i~0_8_49 aux_div_v_main_~i~0_8_49) 2) aux_div_v_main_~i~0_8_49)) (<= (+ (div (+ ~SIZE~0 (- 2)) 2) 2) aux_div_v_main_~i~0_8_49))) (<= (+ (div (+ ~SIZE~0 (- 2)) 2) 1) 0)) (or (forall ((aux_div_v_main_~i~0_8_51 Int) (aux_div_v_main_~sum~0_9_42 Int)) (or (<= aux_div_v_main_~i~0_8_51 (div (+ ~SIZE~0 (- 2)) 2)) (<= (+ (div (+ (- 1) ~SIZE~0) 2) 1) aux_div_v_main_~i~0_8_51) (< (+ (* (* aux_div_v_main_~i~0_8_51 aux_div_v_main_~i~0_8_51) 2) (* 3 aux_div_v_main_~i~0_8_51) 1) (* aux_div_v_main_~sum~0_9_42 18446744073709551616)) (= (+ (* aux_div_v_main_~sum~0_9_42 18446744073709551616) (mod (div (* ~SIZE~0 (+ ~SIZE~0 1)) 2) 18446744073709551616)) (+ (* (* aux_div_v_main_~i~0_8_51 aux_div_v_main_~i~0_8_51) 2) (* 3 aux_div_v_main_~i~0_8_51) 1)) (<= (+ (* aux_div_v_main_~sum~0_9_42 18446744073709551616) 18446744073709551615) (+ (* (* aux_div_v_main_~i~0_8_51 aux_div_v_main_~i~0_8_51) 2) (* 3 aux_div_v_main_~i~0_8_51))))) (<= (+ (div (+ (- 1) ~SIZE~0) 2) 1) 0)))} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {238#(and (or (< 0 ~SIZE~0) (<= 1 (div (+ (- 1) (mod (div (* ~SIZE~0 (+ ~SIZE~0 1)) 2) 18446744073709551616)) (- 18446744073709551616)))) (or (forall ((aux_div_v_main_~sum~0_9_42 Int) (aux_div_v_main_~i~0_8_49 Int)) (or (< (+ (* (* aux_div_v_main_~i~0_8_49 aux_div_v_main_~i~0_8_49) 2) aux_div_v_main_~i~0_8_49) (* aux_div_v_main_~sum~0_9_42 18446744073709551616)) (< (* 2 aux_div_v_main_~i~0_8_49) ~SIZE~0) (<= (+ (* aux_div_v_main_~sum~0_9_42 18446744073709551616) 18446744073709551616) (+ (* (* aux_div_v_main_~i~0_8_49 aux_div_v_main_~i~0_8_49) 2) aux_div_v_main_~i~0_8_49)) (= (+ (* aux_div_v_main_~sum~0_9_42 18446744073709551616) (mod (div (* ~SIZE~0 (+ ~SIZE~0 1)) 2) 18446744073709551616)) (+ (* (* aux_div_v_main_~i~0_8_49 aux_div_v_main_~i~0_8_49) 2) aux_div_v_main_~i~0_8_49)) (<= (+ (div (+ ~SIZE~0 (- 2)) 2) 2) aux_div_v_main_~i~0_8_49))) (<= (+ (div (+ ~SIZE~0 (- 2)) 2) 1) 0)) (or (forall ((aux_div_v_main_~i~0_8_51 Int) (aux_div_v_main_~sum~0_9_42 Int)) (or (<= aux_div_v_main_~i~0_8_51 (div (+ ~SIZE~0 (- 2)) 2)) (<= (+ (div (+ (- 1) ~SIZE~0) 2) 1) aux_div_v_main_~i~0_8_51) (< (+ (* (* aux_div_v_main_~i~0_8_51 aux_div_v_main_~i~0_8_51) 2) (* 3 aux_div_v_main_~i~0_8_51) 1) (* aux_div_v_main_~sum~0_9_42 18446744073709551616)) (= (+ (* aux_div_v_main_~sum~0_9_42 18446744073709551616) (mod (div (* ~SIZE~0 (+ ~SIZE~0 1)) 2) 18446744073709551616)) (+ (* (* aux_div_v_main_~i~0_8_51 aux_div_v_main_~i~0_8_51) 2) (* 3 aux_div_v_main_~i~0_8_51) 1)) (<= (+ (* aux_div_v_main_~sum~0_9_42 18446744073709551616) 18446744073709551615) (+ (* (* aux_div_v_main_~i~0_8_51 aux_div_v_main_~i~0_8_51) 2) (* 3 aux_div_v_main_~i~0_8_51))))) (<= (+ (div (+ (- 1) ~SIZE~0) 2) 1) 0)))} is VALID [2022-04-27 17:03:56,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#true} [50] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= v_~SIZE~0_4 40000) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {238#(and (or (< 0 ~SIZE~0) (<= 1 (div (+ (- 1) (mod (div (* ~SIZE~0 (+ ~SIZE~0 1)) 2) 18446744073709551616)) (- 18446744073709551616)))) (or (forall ((aux_div_v_main_~sum~0_9_42 Int) (aux_div_v_main_~i~0_8_49 Int)) (or (< (+ (* (* aux_div_v_main_~i~0_8_49 aux_div_v_main_~i~0_8_49) 2) aux_div_v_main_~i~0_8_49) (* aux_div_v_main_~sum~0_9_42 18446744073709551616)) (< (* 2 aux_div_v_main_~i~0_8_49) ~SIZE~0) (<= (+ (* aux_div_v_main_~sum~0_9_42 18446744073709551616) 18446744073709551616) (+ (* (* aux_div_v_main_~i~0_8_49 aux_div_v_main_~i~0_8_49) 2) aux_div_v_main_~i~0_8_49)) (= (+ (* aux_div_v_main_~sum~0_9_42 18446744073709551616) (mod (div (* ~SIZE~0 (+ ~SIZE~0 1)) 2) 18446744073709551616)) (+ (* (* aux_div_v_main_~i~0_8_49 aux_div_v_main_~i~0_8_49) 2) aux_div_v_main_~i~0_8_49)) (<= (+ (div (+ ~SIZE~0 (- 2)) 2) 2) aux_div_v_main_~i~0_8_49))) (<= (+ (div (+ ~SIZE~0 (- 2)) 2) 1) 0)) (or (forall ((aux_div_v_main_~i~0_8_51 Int) (aux_div_v_main_~sum~0_9_42 Int)) (or (<= aux_div_v_main_~i~0_8_51 (div (+ ~SIZE~0 (- 2)) 2)) (<= (+ (div (+ (- 1) ~SIZE~0) 2) 1) aux_div_v_main_~i~0_8_51) (< (+ (* (* aux_div_v_main_~i~0_8_51 aux_div_v_main_~i~0_8_51) 2) (* 3 aux_div_v_main_~i~0_8_51) 1) (* aux_div_v_main_~sum~0_9_42 18446744073709551616)) (= (+ (* aux_div_v_main_~sum~0_9_42 18446744073709551616) (mod (div (* ~SIZE~0 (+ ~SIZE~0 1)) 2) 18446744073709551616)) (+ (* (* aux_div_v_main_~i~0_8_51 aux_div_v_main_~i~0_8_51) 2) (* 3 aux_div_v_main_~i~0_8_51) 1)) (<= (+ (* aux_div_v_main_~sum~0_9_42 18446744073709551616) 18446744073709551615) (+ (* (* aux_div_v_main_~i~0_8_51 aux_div_v_main_~i~0_8_51) 2) (* 3 aux_div_v_main_~i~0_8_51))))) (<= (+ (div (+ (- 1) ~SIZE~0) 2) 1) 0)))} is VALID [2022-04-27 17:03:56,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {173#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#true} is VALID [2022-04-27 17:03:56,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-04-27 17:03:56,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:03:56,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451239164] [2022-04-27 17:03:56,138 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:03:56,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537045181] [2022-04-27 17:03:56,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537045181] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 17:03:56,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 17:03:56,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2022-04-27 17:03:56,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753635678] [2022-04-27 17:03:56,138 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 17:03:56,139 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 12 [2022-04-27 17:03:56,139 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:03:56,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 17:03:58,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 19 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 17:03:58,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 17:03:58,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:03:58,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 17:03:58,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=4, NotChecked=18, Total=132 [2022-04-27 17:03:58,313 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 12 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 17:04:02,552 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-27 17:04:11,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:04:11,407 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-04-27 17:04:11,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 17:04:11,407 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 12 [2022-04-27 17:04:11,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:04:11,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 17:04:11,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2022-04-27 17:04:11,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 17:04:11,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2022-04-27 17:04:11,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 21 transitions. [2022-04-27 17:04:11,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:04:11,817 INFO L225 Difference]: With dead ends: 19 [2022-04-27 17:04:11,817 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 17:04:11,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 53.4s TimeCoverageRelationStatistics Valid=63, Invalid=146, Unknown=5, NotChecked=26, Total=240 [2022-04-27 17:04:11,818 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 8 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-27 17:04:11,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 44 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 1 Unknown, 18 Unchecked, 2.5s Time] [2022-04-27 17:04:11,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 17:04:11,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 17:04:11,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:04:11,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:04:11,820 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:04:11,821 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:04:11,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:04:11,821 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 17:04:11,821 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 17:04:11,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:04:11,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:04:11,822 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 17:04:11,822 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 17:04:11,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:04:11,823 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 17:04:11,823 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 17:04:11,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:04:11,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:04:11,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:04:11,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:04:11,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:04:11,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-27 17:04:11,824 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2022-04-27 17:04:11,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:04:11,824 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-27 17:04:11,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 17:04:11,824 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 17:04:11,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 17:04:11,824 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:04:11,825 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:04:11,828 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-27 17:04:12,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 17:04:12,028 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:04:12,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:04:12,028 INFO L85 PathProgramCache]: Analyzing trace with hash -771029098, now seen corresponding path program 2 times [2022-04-27 17:04:12,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:04:12,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376848610] [2022-04-27 17:04:12,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:04:12,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:04:12,042 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:04:12,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2043957427] [2022-04-27 17:04:12,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 17:04:12,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:04:12,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:04:12,043 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-27 17:04:12,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process