/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/sum_by_3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-20 04:20:03,426 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 04:20:03,428 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 04:20:03,466 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 04:20:03,466 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 04:20:03,468 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 04:20:03,470 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 04:20:03,472 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 04:20:03,473 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 04:20:03,479 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 04:20:03,480 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 04:20:03,481 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 04:20:03,481 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 04:20:03,481 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 04:20:03,482 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 04:20:03,482 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 04:20:03,483 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 04:20:03,483 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 04:20:03,484 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 04:20:03,485 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 04:20:03,485 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 04:20:03,487 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 04:20:03,487 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 04:20:03,488 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 04:20:03,488 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 04:20:03,489 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 04:20:03,490 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 04:20:03,490 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 04:20:03,490 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 04:20:03,490 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 04:20:03,491 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 04:20:03,491 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 04:20:03,491 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 04:20:03,492 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 04:20:03,492 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 04:20:03,493 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 04:20:03,493 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 04:20:03,493 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 04:20:03,493 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 04:20:03,493 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 04:20:03,494 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 04:20:03,499 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 04:20:03,499 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-03-20 04:20:03,509 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 04:20:03,509 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 04:20:03,511 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 04:20:03,512 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-20 04:20:03,512 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 04:20:03,512 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-20 04:20:03,512 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 04:20:03,512 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 04:20:03,512 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 04:20:03,512 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 04:20:03,513 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-20 04:20:03,513 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 04:20:03,513 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 04:20:03,513 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 04:20:03,513 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 04:20:03,513 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 04:20:03,513 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-20 04:20:03,513 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 04:20:03,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 04:20:03,513 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 04:20:03,513 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-20 04:20:03,514 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-20 04:20:03,514 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-20 04:20:03,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 04:20:03,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 04:20:03,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 04:20:03,687 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 04:20:03,687 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 04:20:03,688 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sum_by_3.c [2022-03-20 04:20:03,731 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33ee49428/898c183d32a84e918ba8301a09e7dedf/FLAGc07fbe7a9 [2022-03-20 04:20:04,107 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 04:20:04,108 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sum_by_3.c [2022-03-20 04:20:04,113 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33ee49428/898c183d32a84e918ba8301a09e7dedf/FLAGc07fbe7a9 [2022-03-20 04:20:04,128 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33ee49428/898c183d32a84e918ba8301a09e7dedf [2022-03-20 04:20:04,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 04:20:04,131 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-20 04:20:04,133 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 04:20:04,133 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 04:20:04,136 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 04:20:04,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 04:20:04" (1/1) ... [2022-03-20 04:20:04,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39811291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:20:04, skipping insertion in model container [2022-03-20 04:20:04,138 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 04:20:04" (1/1) ... [2022-03-20 04:20:04,143 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 04:20:04,152 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 04:20:04,307 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_by_3.c[406,419] [2022-03-20 04:20:04,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 04:20:04,329 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 04:20:04,337 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_by_3.c[406,419] [2022-03-20 04:20:04,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 04:20:04,353 INFO L208 MainTranslator]: Completed translation [2022-03-20 04:20:04,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:20:04 WrapperNode [2022-03-20 04:20:04,354 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 04:20:04,354 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 04:20:04,354 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 04:20:04,355 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 04:20:04,362 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:20:04" (1/1) ... [2022-03-20 04:20:04,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:20:04" (1/1) ... [2022-03-20 04:20:04,367 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:20:04" (1/1) ... [2022-03-20 04:20:04,367 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:20:04" (1/1) ... [2022-03-20 04:20:04,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:20:04" (1/1) ... [2022-03-20 04:20:04,378 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:20:04" (1/1) ... [2022-03-20 04:20:04,382 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:20:04" (1/1) ... [2022-03-20 04:20:04,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 04:20:04,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 04:20:04,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 04:20:04,386 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 04:20:04,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:20:04" (1/1) ... [2022-03-20 04:20:04,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 04:20:04,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:20:04,409 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-20 04:20:04,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-20 04:20:04,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 04:20:04,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 04:20:04,440 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 04:20:04,440 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-03-20 04:20:04,440 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-20 04:20:04,440 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 04:20:04,440 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 04:20:04,440 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 04:20:04,441 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 04:20:04,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 04:20:04,441 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-03-20 04:20:04,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-20 04:20:04,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-03-20 04:20:04,441 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 04:20:04,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 04:20:04,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 04:20:04,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 04:20:04,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 04:20:04,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 04:20:04,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 04:20:04,487 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 04:20:04,488 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 04:20:04,592 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 04:20:04,596 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 04:20:04,596 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-20 04:20:04,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 04:20:04 BoogieIcfgContainer [2022-03-20 04:20:04,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 04:20:04,598 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-20 04:20:04,598 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-20 04:20:04,604 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-20 04:20:04,606 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 04:20:04" (1/1) ... [2022-03-20 04:20:04,608 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-03-20 04:20:04,769 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-03-20 04:20:04,770 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) (< (mod v_main_~i~0_6 4294967296) (mod v_main_~n~0_11 4294967296))) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_11} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_11} AuxVars[] AssignedVars[main_~i~0] to Formula: (let ((.cse1 (mod v_main_~i~0_6 4294967296)) (.cse0 (mod v_main_~n~0_11 4294967296))) (or (and (= v_main_~i~0_6 v_main_~i~0_5) (<= .cse0 .cse1)) (and (< v_main_~i~0_6 v_main_~i~0_5) (<= (div (+ .cse0 (* (- 1) v_main_~i~0_5)) (- 4294967296)) (+ (div (+ v_main_~i~0_6 (- 4294967295)) 4294967296) 1)) (< .cse1 .cse0)))) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_11} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_11} AuxVars[] AssignedVars[main_~i~0] [2022-03-20 04:20:04,834 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-03-20 04:20:04,834 INFO L91 elerationTransformer]: Accelerated Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (< (mod v_main_~j~0_3 4294967296) (mod v_main_~n~0_2 4294967296))) InVars {main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_~j~0] to Formula: (let ((.cse0 (mod v_main_~n~0_2 4294967296)) (.cse1 (mod v_main_~j~0_3 4294967296))) (or (and (<= (div (+ .cse0 (* (- 1) v_main_~j~0_2)) (- 4294967296)) (+ (div (+ v_main_~j~0_3 (- 4294967295)) 4294967296) 1)) (< .cse1 .cse0) (< v_main_~j~0_3 v_main_~j~0_2)) (and (= v_main_~j~0_3 v_main_~j~0_2) (<= .cse0 .cse1)))) InVars {main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_~j~0] [2022-03-20 04:20:04,888 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-03-20 04:20:04,889 INFO L91 elerationTransformer]: Accelerated Formula: (and (< (mod v_main_~k~0_5 4294967296) (mod v_main_~n~0_9 4294967296)) (= v_main_~k~0_4 (+ v_main_~k~0_5 1))) InVars {main_~k~0=v_main_~k~0_5, main_~n~0=v_main_~n~0_9} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~k~0] to Formula: (let ((.cse1 (mod v_main_~n~0_9 4294967296)) (.cse0 (mod v_main_~k~0_5 4294967296))) (or (and (< .cse0 .cse1) (< v_main_~k~0_5 v_main_~k~0_4) (<= (div (+ .cse1 (* (- 1) v_main_~k~0_4)) (- 4294967296)) (+ (div (+ v_main_~k~0_5 (- 4294967295)) 4294967296) 1))) (and (<= .cse1 .cse0) (= v_main_~k~0_5 v_main_~k~0_4)))) InVars {main_~k~0=v_main_~k~0_5, main_~n~0=v_main_~n~0_9} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~k~0] [2022-03-20 04:20:04,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 04:20:04 BasicIcfg [2022-03-20 04:20:04,892 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-20 04:20:04,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 04:20:04,893 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 04:20:04,895 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 04:20:04,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 04:20:04" (1/4) ... [2022-03-20 04:20:04,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4285c9c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 04:20:04, skipping insertion in model container [2022-03-20 04:20:04,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:20:04" (2/4) ... [2022-03-20 04:20:04,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4285c9c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 04:20:04, skipping insertion in model container [2022-03-20 04:20:04,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 04:20:04" (3/4) ... [2022-03-20 04:20:04,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4285c9c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 04:20:04, skipping insertion in model container [2022-03-20 04:20:04,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 04:20:04" (4/4) ... [2022-03-20 04:20:04,899 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_by_3.cJordan [2022-03-20 04:20:04,902 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-03-20 04:20:04,902 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 04:20:04,927 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 04:20:04,930 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-03-20 04:20:04,931 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 04:20:04,938 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 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-03-20 04:20:04,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-20 04:20:04,942 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:20:04,942 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:20:04,943 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:20:04,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:20:04,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1502834522, now seen corresponding path program 1 times [2022-03-20 04:20:04,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:20:04,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072789416] [2022-03-20 04:20:04,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:20:04,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:20:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:20:05,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:20:05,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:20:05,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:20:05,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:20:05,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072789416] [2022-03-20 04:20:05,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072789416] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:20:05,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 04:20:05,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-20 04:20:05,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349533825] [2022-03-20 04:20:05,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:20:05,078 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-20 04:20:05,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:20:05,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-20 04:20:05,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-20 04:20:05,101 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 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 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-03-20 04:20:05,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:20:05,130 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-03-20 04:20:05,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-20 04:20:05,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 16 [2022-03-20 04:20:05,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:20:05,136 INFO L225 Difference]: With dead ends: 24 [2022-03-20 04:20:05,136 INFO L226 Difference]: Without dead ends: 17 [2022-03-20 04:20:05,138 INFO L912 BasicCegarLoop]: 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-03-20 04:20:05,141 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 27 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-03-20 04:20:05,143 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 27 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 04:20:05,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-03-20 04:20:05,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-03-20 04:20:05,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-03-20 04:20:05,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-03-20 04:20:05,166 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 16 [2022-03-20 04:20:05,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:20:05,166 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-03-20 04:20:05,166 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-03-20 04:20:05,166 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-03-20 04:20:05,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-20 04:20:05,167 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:20:05,167 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:20:05,167 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 04:20:05,168 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:20:05,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:20:05,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1872181992, now seen corresponding path program 1 times [2022-03-20 04:20:05,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:20:05,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187949330] [2022-03-20 04:20:05,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:20:05,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:20:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:20:05,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:20:05,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:20:05,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:20:05,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:20:05,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187949330] [2022-03-20 04:20:05,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187949330] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:20:05,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 04:20:05,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 04:20:05,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921180259] [2022-03-20 04:20:05,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:20:05,583 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 04:20:05,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:20:05,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 04:20:05,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-03-20 04:20:05,584 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 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-03-20 04:20:05,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:20:05,795 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-03-20 04:20:05,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 04:20:05,796 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 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 16 [2022-03-20 04:20:05,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:20:05,798 INFO L225 Difference]: With dead ends: 31 [2022-03-20 04:20:05,798 INFO L226 Difference]: Without dead ends: 28 [2022-03-20 04:20:05,801 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-03-20 04:20:05,802 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 67 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:20:05,804 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 23 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 04:20:05,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-03-20 04:20:05,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2022-03-20 04:20:05,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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-03-20 04:20:05,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-03-20 04:20:05,819 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 16 [2022-03-20 04:20:05,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:20:05,819 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-03-20 04:20:05,819 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 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-03-20 04:20:05,820 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-03-20 04:20:05,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-20 04:20:05,820 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:20:05,820 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:20:05,820 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-20 04:20:05,821 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:20:05,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:20:05,821 INFO L85 PathProgramCache]: Analyzing trace with hash -2065178785, now seen corresponding path program 1 times [2022-03-20 04:20:05,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:20:05,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181549470] [2022-03-20 04:20:05,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:20:05,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:20:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:20:06,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:20:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:20:06,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:20:06,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:20:06,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181549470] [2022-03-20 04:20:06,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181549470] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:20:06,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872557743] [2022-03-20 04:20:06,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:20:06,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:20:06,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:20:06,182 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:20:06,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-20 04:20:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:20:06,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-20 04:20:06,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:20:06,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:20:06,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:21:10,556 WARN L855 $PredicateComparison]: unable to prove that (forall ((aux_mod_aux_div_aux_mod_v_main_~k~0_9_54_32_52 Int)) (or (<= aux_mod_aux_div_aux_mod_v_main_~k~0_9_54_32_52 0) (let ((.cse1 (mod c_main_~j~0 4294967296)) (.cse2 (* 2 c_main_~j~0)) (.cse6 (* (- 3) aux_mod_aux_div_aux_mod_v_main_~k~0_9_54_32_52)) (.cse3 (* (- 1) c_main_~i~0)) (.cse5 (* 3 aux_mod_aux_div_aux_mod_v_main_~k~0_9_54_32_52)) (.cse0 (mod c_main_~n~0 4294967296))) (and (or (not (<= .cse0 .cse1)) (let ((.cse4 (* (- 2) c_main_~j~0))) (<= (div (+ (div (+ c_main_~i~0 .cse2 (- 4294967296)) 4294967296) (* (- 1) (div (+ (- 1) .cse3 .cse4 .cse5) (- 4294967296))) 1) (- 3)) (+ (div (+ (* (- 1) (div (+ (- 1) .cse3 .cse4) (- 4294967296))) (div (+ .cse6 c_main_~i~0 (- 3) .cse2) 4294967296) 1) 3) 1)))) (let ((.cse11 (* (- 1) c_main_~j~0)) (.cse10 (* (- 1) .cse0))) (let ((.cse8 (div (+ (- 1) .cse3 .cse11 .cse10 .cse5) 4294967296)) (.cse7 (div (+ c_main_~j~0 (- 4294967295)) 4294967296))) (or (not (< .cse1 .cse0)) (<= .cse7 (+ .cse8 (div (+ .cse6 c_main_~i~0 (- 2) .cse2) 4294967296))) (let ((.cse9 (* (- 1) .cse7))) (<= (div (+ .cse8 .cse9 (div (+ c_main_~i~0 .cse2 (- 4294967295)) 4294967296)) (- 3)) (+ (div (+ (* (- 1) (div (+ .cse6 c_main_~i~0 .cse0 c_main_~j~0 (- 4294967298)) (- 4294967296))) (div (+ .cse10 c_main_~j~0) 4294967296) .cse9 1 (div (+ (- 1) .cse3 .cse11 .cse10) 4294967296)) 3) 1))) (<= (div (+ (- 4294967296) .cse5) (- 12884901888)) (+ (div (+ .cse6 (- 3)) 12884901888) 1))))))) (<= 4294967296 aux_mod_aux_div_aux_mod_v_main_~k~0_9_54_32_52))) is different from true [2022-03-20 04:21:12,614 WARN L833 $PredicateComparison]: unable to prove that (forall ((aux_mod_aux_div_aux_mod_v_main_~k~0_9_54_32_52 Int)) (or (<= aux_mod_aux_div_aux_mod_v_main_~k~0_9_54_32_52 0) (let ((.cse1 (* (- 1) c_main_~i~0)) (.cse2 (* (- 2) c_main_~j~0)) (.cse0 (* 2 c_main_~j~0))) (<= (div (+ (div (+ c_main_~i~0 .cse0 (- 4294967296)) 4294967296) (* (- 1) (div (+ (- 1) .cse1 .cse2 (* 3 aux_mod_aux_div_aux_mod_v_main_~k~0_9_54_32_52)) (- 4294967296))) 1) (- 3)) (+ (div (+ (* (- 1) (div (+ (- 1) .cse1 .cse2) (- 4294967296))) (div (+ (* (- 3) aux_mod_aux_div_aux_mod_v_main_~k~0_9_54_32_52) c_main_~i~0 (- 3) .cse0) 4294967296) 1) 3) 1))) (<= 4294967296 aux_mod_aux_div_aux_mod_v_main_~k~0_9_54_32_52))) is different from false [2022-03-20 04:21:18,895 WARN L833 $PredicateComparison]: unable to prove that (forall ((aux_mod_aux_div_aux_mod_v_main_~k~0_9_54_32_52 Int)) (or (<= aux_mod_aux_div_aux_mod_v_main_~k~0_9_54_32_52 0) (let ((.cse3 (mod c_main_~i~0 4294967296))) (let ((.cse0 (* (- 1) c_main_~i~0)) (.cse1 (* .cse3 (- 2))) (.cse2 (* .cse3 2))) (<= (div (+ (* (- 1) (div (+ (- 1) .cse0 .cse1 (* 3 aux_mod_aux_div_aux_mod_v_main_~k~0_9_54_32_52)) (- 4294967296))) (div (+ .cse2 c_main_~i~0 (- 4294967296)) 4294967296) 1) (- 3)) (+ (div (+ (* (- 1) (div (+ (- 1) .cse0 .cse1) (- 4294967296))) (div (+ (* (- 3) aux_mod_aux_div_aux_mod_v_main_~k~0_9_54_32_52) .cse2 c_main_~i~0 (- 3)) 4294967296) 1) 3) 1)))) (<= 4294967296 aux_mod_aux_div_aux_mod_v_main_~k~0_9_54_32_52))) is different from false [2022-03-20 04:21:18,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:21:18,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872557743] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:21:18,998 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:21:18,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2022-03-20 04:21:18,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551670829] [2022-03-20 04:21:18,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:21:18,998 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-20 04:21:18,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:21:18,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-20 04:21:18,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=305, Unknown=9, NotChecked=114, Total=506 [2022-03-20 04:21:18,999 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 20 states have internal predecessors, (32), 5 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-03-20 04:21:34,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:21:34,570 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-03-20 04:21:34,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 04:21:34,570 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 20 states have internal predecessors, (32), 5 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-03-20 04:21:34,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:21:34,571 INFO L225 Difference]: With dead ends: 28 [2022-03-20 04:21:34,571 INFO L226 Difference]: Without dead ends: 18 [2022-03-20 04:21:34,571 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 44.6s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=12, NotChecked=156, Total=870 [2022-03-20 04:21:34,572 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 51 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 04:21:34,572 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 65 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 157 Invalid, 0 Unknown, 78 Unchecked, 0.2s Time] [2022-03-20 04:21:34,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-03-20 04:21:34,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-03-20 04:21:34,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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-03-20 04:21:34,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-03-20 04:21:34,574 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 17 [2022-03-20 04:21:34,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:21:34,574 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-03-20 04:21:34,574 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 20 states have internal predecessors, (32), 5 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-03-20 04:21:34,574 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-03-20 04:21:34,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-20 04:21:34,574 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:21:34,575 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:21:34,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-20 04:21:34,775 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:21:34,775 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:21:34,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:21:34,776 INFO L85 PathProgramCache]: Analyzing trace with hash 301668447, now seen corresponding path program 1 times [2022-03-20 04:21:34,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:21:34,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055083076] [2022-03-20 04:21:34,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:21:34,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:21:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:21:35,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:21:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:21:35,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:21:35,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:21:35,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055083076] [2022-03-20 04:21:35,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055083076] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:21:35,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852021054] [2022-03-20 04:21:35,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:21:35,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:21:35,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:21:35,304 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:21:35,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-20 04:21:35,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:21:35,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-20 04:21:35,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:21:45,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:21:45,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:22:11,257 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~i~0 4294967296))) (or (<= (mod (div (mod (+ (* .cse0 2) c_main_~i~0) 4294967296) 3) 4294967296) (mod c_~SIZE~0 4294967296)) (< .cse0 (mod c_main_~n~0 4294967296)))) is different from true [2022-03-20 04:25:55,748 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_main_~n~0 4294967296)) (.cse0 (mod c_main_~i~0 4294967296))) (and (or (not (< .cse0 .cse1)) (forall ((aux_div_v_main_~i~0_11_31 Int) (aux_div_aux_mod_aux_mod_v_main_~i~0_11_31_42_199 Int) (aux_mod_aux_mod_aux_mod_v_main_~i~0_11_31_42_199 Int) (aux_div_aux_mod_v_main_~i~0_11_31_42 Int)) (let ((.cse6 (mod c_main_~n~0 4294967296)) (.cse3 (* aux_div_aux_mod_aux_mod_v_main_~i~0_11_31_42_199 4294967296))) (let ((.cse5 (* 4294967296 aux_div_aux_mod_v_main_~i~0_11_31_42)) (.cse2 (+ .cse6 .cse3)) (.cse4 (* 4294967296 aux_div_v_main_~i~0_11_31))) (or (<= .cse2 (+ c_main_~i~0 aux_mod_aux_mod_aux_mod_v_main_~i~0_11_31_42_199)) (< .cse3 (+ .cse4 aux_mod_aux_mod_aux_mod_v_main_~i~0_11_31_42_199 .cse5)) (<= (+ .cse4 aux_mod_aux_mod_aux_mod_v_main_~i~0_11_31_42_199 .cse5 4294967296) .cse2) (<= (+ .cse4 aux_mod_aux_mod_aux_mod_v_main_~i~0_11_31_42_199 4294967296) .cse2) (<= (mod (div (mod (+ (* 3 .cse6) (* aux_mod_aux_mod_aux_mod_v_main_~i~0_11_31_42_199 4294967293)) 4294967296) 3) 4294967296) (mod c_~SIZE~0 4294967296)) (< (+ (div (+ c_main_~i~0 (- 4294967295)) 4294967296) 1) aux_div_aux_mod_aux_mod_v_main_~i~0_11_31_42_199) (< .cse2 (+ .cse4 aux_mod_aux_mod_aux_mod_v_main_~i~0_11_31_42_199)) (< aux_mod_aux_mod_aux_mod_v_main_~i~0_11_31_42_199 0)))))) (or (not (<= .cse1 .cse0)) (<= (mod (div (mod (* c_main_~i~0 3) 4294967296) 3) 4294967296) (mod c_~SIZE~0 4294967296))))) is different from true [2022-03-20 04:25:55,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-20 04:25:55,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852021054] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:25:55,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:25:55,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 23 [2022-03-20 04:25:55,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666999351] [2022-03-20 04:25:55,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:25:55,899 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-20 04:25:55,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:25:55,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-20 04:25:55,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=340, Unknown=9, NotChecked=78, Total=506 [2022-03-20 04:25:55,900 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 20 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 04:25:58,046 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 04:26:11,029 WARN L232 SmtUtils]: Spent 12.84s on a formula simplification. DAG size of input: 43 DAG size of output: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 04:26:13,224 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_main_~n~0 4294967296)) (.cse0 (mod c_~SIZE~0 4294967296)) (.cse5 (mod c_main_~i~0 4294967296)) (.cse1 (* (- 1) c_main_~i~0)) (.cse3 (< 0 c_main_~i~0)) (.cse4 (= c_main_~i~0 0))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (<= c_~SIZE~0 20000001) (<= (mod (div (mod (+ c_main_~i~0 (* 2 c_main_~j~0)) 4294967296) 3) 4294967296) .cse0) (or (and (<= (div (+ .cse1 .cse2) (- 4294967296)) 0) .cse3) (and (<= .cse2 0) .cse4)) (<= .cse2 .cse0) (<= 20000001 c_~SIZE~0) (= .cse5 c_main_~j~0) (or (and (< 0 (+ (div (+ .cse0 .cse1) 4294967296) (div (+ .cse5 .cse1) 4294967296) 1)) .cse3) .cse4) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (= |c_old(~SIZE~0)| c_~SIZE~0))) is different from false [2022-03-20 04:26:15,357 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296)) (.cse1 (mod c_main_~i~0 4294967296))) (and (<= c_~SIZE~0 20000001) (<= (mod (div (mod (+ c_main_~i~0 (* 2 c_main_~j~0)) 4294967296) 3) 4294967296) .cse0) (<= 20000001 c_~SIZE~0) (= .cse1 c_main_~j~0) (or (and (< 0 (let ((.cse2 (* (- 1) c_main_~i~0))) (+ (div (+ .cse0 .cse2) 4294967296) (div (+ .cse1 .cse2) 4294967296) 1))) (< 0 c_main_~i~0)) (= c_main_~i~0 0)))) is different from false [2022-03-20 04:26:41,056 WARN L232 SmtUtils]: Spent 19.25s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 04:26:43,071 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 04:26:45,277 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 04:26:47,417 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 04:26:49,559 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 04:26:51,697 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 04:26:53,840 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 04:26:55,980 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 04:26:58,251 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 04:27:00,468 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 04:27:02,695 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 04:27:07,199 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296)) (.cse1 (mod c_main_~i~0 4294967296))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (<= c_~SIZE~0 20000001) (<= (mod (div (mod (+ c_main_~i~0 (* 2 c_main_~j~0)) 4294967296) 3) 4294967296) .cse0) (<= 20000001 c_~SIZE~0) (= .cse1 c_main_~j~0) (or (and (< 0 (let ((.cse2 (* (- 1) c_main_~i~0))) (+ (div (+ .cse0 .cse2) 4294967296) (div (+ .cse1 .cse2) 4294967296) 1))) (< 0 c_main_~i~0)) (= c_main_~i~0 0)) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (= |c_old(~SIZE~0)| c_~SIZE~0))) is different from false [2022-03-20 04:27:09,218 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 04:27:11,417 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 04:27:13,691 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-03-20 04:27:13,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:27:13,848 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-03-20 04:27:13,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-20 04:27:13,848 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 20 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 17 [2022-03-20 04:27:13,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:27:13,849 INFO L225 Difference]: With dead ends: 29 [2022-03-20 04:27:13,849 INFO L226 Difference]: Without dead ends: 26 [2022-03-20 04:27:13,849 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 69.0s TimeCoverageRelationStatistics Valid=158, Invalid=602, Unknown=16, NotChecked=280, Total=1056 [2022-03-20 04:27:13,850 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 24 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 20 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 30.6s IncrementalHoareTripleChecker+Time [2022-03-20 04:27:13,850 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 54 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 168 Invalid, 14 Unknown, 76 Unchecked, 30.6s Time] [2022-03-20 04:27:13,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-03-20 04:27:13,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2022-03-20 04:27:13,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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-03-20 04:27:13,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-03-20 04:27:13,853 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 17 [2022-03-20 04:27:13,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:27:13,853 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-03-20 04:27:13,853 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 20 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 04:27:13,854 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-03-20 04:27:13,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-20 04:27:13,854 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:27:13,854 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:27:13,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-03-20 04:27:14,055 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-20 04:27:14,056 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:27:14,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:27:14,056 INFO L85 PathProgramCache]: Analyzing trace with hash 788508872, now seen corresponding path program 1 times [2022-03-20 04:27:14,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:27:14,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140585018] [2022-03-20 04:27:14,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:27:14,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:27:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:27:16,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:27:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:27:16,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:27:16,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:27:16,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140585018] [2022-03-20 04:27:16,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140585018] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:27:16,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103080808] [2022-03-20 04:27:16,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:27:16,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:27:16,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:27:16,807 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:27:16,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-20 04:27:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:27:16,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-20 04:27:16,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:27:50,912 WARN L232 SmtUtils]: Spent 5.07s on a formula simplification that was a NOOP. DAG size: 11 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-03-20 04:28:06,793 WARN L232 SmtUtils]: Spent 5.14s on a formula simplification that was a NOOP. DAG size: 10 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-03-20 04:30:03,789 WARN L232 SmtUtils]: Spent 5.05s on a formula simplification that was a NOOP. DAG size: 16 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-03-20 04:30:41,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:30:41,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:32:20,834 WARN L232 SmtUtils]: Spent 12.43s on a formula simplification that was a NOOP. DAG size: 150 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 04:32:21,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:32:21,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103080808] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:32:21,078 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:32:21,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 10] total 28 [2022-03-20 04:32:21,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580929681] [2022-03-20 04:32:21,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:32:21,079 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-20 04:32:21,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:32:21,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-20 04:32:21,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=597, Unknown=25, NotChecked=0, Total=756 [2022-03-20 04:32:21,080 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 28 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 25 states have internal predecessors, (37), 6 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 04:32:30,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:32:30,719 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-03-20 04:32:30,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 04:32:30,720 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 25 states have internal predecessors, (37), 6 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 18 [2022-03-20 04:32:30,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:32:30,720 INFO L225 Difference]: With dead ends: 19 [2022-03-20 04:32:30,720 INFO L226 Difference]: Without dead ends: 0 [2022-03-20 04:32:30,721 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 94.7s TimeCoverageRelationStatistics Valid=235, Invalid=996, Unknown=29, NotChecked=0, Total=1260 [2022-03-20 04:32:30,721 INFO L913 BasicCegarLoop]: 7 mSDtfsCounter, 23 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-20 04:32:30,721 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 48 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 125 Invalid, 0 Unknown, 32 Unchecked, 0.4s Time] [2022-03-20 04:32:30,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-20 04:32:30,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-20 04:32:30,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-20 04:32:30,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-20 04:32:30,722 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-03-20 04:32:30,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:32:30,722 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-20 04:32:30,722 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 25 states have internal predecessors, (37), 6 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 04:32:30,722 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-20 04:32:30,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-20 04:32:30,724 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-20 04:32:30,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-20 04:32:30,929 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:32:30,931 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-03-20 04:32:30,932 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-20 04:32:30,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 04:32:30 BasicIcfg [2022-03-20 04:32:30,933 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-20 04:32:30,934 INFO L158 Benchmark]: Toolchain (without parser) took 746802.61ms. Allocated memory was 203.4MB in the beginning and 263.2MB in the end (delta: 59.8MB). Free memory was 154.9MB in the beginning and 105.2MB in the end (delta: 49.7MB). Peak memory consumption was 109.5MB. Max. memory is 8.0GB. [2022-03-20 04:32:30,934 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 203.4MB. Free memory was 171.1MB in the beginning and 171.1MB in the end (delta: 74.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-20 04:32:30,934 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.94ms. Allocated memory is still 203.4MB. Free memory was 154.7MB in the beginning and 179.3MB in the end (delta: -24.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-20 04:32:30,934 INFO L158 Benchmark]: Boogie Preprocessor took 30.81ms. Allocated memory is still 203.4MB. Free memory was 179.3MB in the beginning and 177.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-20 04:32:30,934 INFO L158 Benchmark]: RCFGBuilder took 211.45ms. Allocated memory is still 203.4MB. Free memory was 177.8MB in the beginning and 167.8MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-03-20 04:32:30,935 INFO L158 Benchmark]: IcfgTransformer took 294.01ms. Allocated memory is still 203.4MB. Free memory was 167.8MB in the beginning and 149.7MB in the end (delta: 18.1MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-03-20 04:32:30,935 INFO L158 Benchmark]: TraceAbstraction took 746040.69ms. Allocated memory was 203.4MB in the beginning and 263.2MB in the end (delta: 59.8MB). Free memory was 149.2MB in the beginning and 105.2MB in the end (delta: 44.0MB). Peak memory consumption was 104.5MB. Max. memory is 8.0GB. [2022-03-20 04:32:30,936 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from IcfgTransformer: - StatisticsResult: Jordan loop acceleration statistics 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult - StatisticsResult: Jordan loop acceleration statistics 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult - StatisticsResult: Jordan loop acceleration statistics 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 203.4MB. Free memory was 171.1MB in the beginning and 171.1MB in the end (delta: 74.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 220.94ms. Allocated memory is still 203.4MB. Free memory was 154.7MB in the beginning and 179.3MB in the end (delta: -24.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.81ms. Allocated memory is still 203.4MB. Free memory was 179.3MB in the beginning and 177.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 211.45ms. Allocated memory is still 203.4MB. Free memory was 177.8MB in the beginning and 167.8MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * IcfgTransformer took 294.01ms. Allocated memory is still 203.4MB. Free memory was 167.8MB in the beginning and 149.7MB in the end (delta: 18.1MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 746040.69ms. Allocated memory was 203.4MB in the beginning and 263.2MB in the end (delta: 59.8MB). Free memory was 149.2MB in the beginning and 105.2MB in the end (delta: 44.0MB). Peak memory consumption was 104.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 10]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 746.0s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 103.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 14 mSolverCounterUnknown, 184 SdHoareTripleChecker+Valid, 31.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 183 mSDsluCounter, 217 SdHoareTripleChecker+Invalid, 28.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 186 IncrementalHoareTripleChecker+Unchecked, 157 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 526 IncrementalHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 60 mSDtfsCounter, 526 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 186 GetRequests, 72 SyntacticMatches, 7 SemanticMatches, 107 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 208.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=0, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 641.4s InterpolantComputationTime, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 177 ConstructedInterpolants, 12 QuantifiedInterpolants, 5460 SizeOfPredicates, 12 NumberOfNonLiveVariables, 202 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 0/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-03-20 04:32:30,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...