/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/sumt3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 19:57:07,393 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 19:57:07,394 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 19:57:07,424 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 19:57:07,424 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 19:57:07,424 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 19:57:07,428 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 19:57:07,430 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 19:57:07,431 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 19:57:07,432 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 19:57:07,432 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 19:57:07,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 19:57:07,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 19:57:07,433 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 19:57:07,434 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 19:57:07,435 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 19:57:07,435 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 19:57:07,436 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 19:57:07,436 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 19:57:07,437 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 19:57:07,438 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 19:57:07,444 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 19:57:07,445 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 19:57:07,446 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 19:57:07,448 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 19:57:07,455 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 19:57:07,455 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 19:57:07,455 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 19:57:07,455 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 19:57:07,456 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 19:57:07,456 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 19:57:07,456 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 19:57:07,457 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 19:57:07,457 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 19:57:07,457 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 19:57:07,458 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 19:57:07,458 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 19:57:07,458 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 19:57:07,459 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 19:57:07,459 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 19:57:07,459 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 19:57:07,464 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 19:57:07,464 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-14 19:57:07,472 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 19:57:07,473 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 19:57:07,473 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 19:57:07,473 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 19:57:07,473 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 19:57:07,474 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 19:57:07,474 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 19:57:07,474 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 19:57:07,474 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 19:57:07,474 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 19:57:07,474 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 19:57:07,475 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 19:57:07,475 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 19:57:07,475 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 19:57:07,475 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 19:57:07,475 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 19:57:07,475 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 19:57:07,475 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 19:57:07,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 19:57:07,475 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 19:57:07,475 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 19:57:07,476 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 19:57:07,476 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-14 19:57:07,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 19:57:07,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 19:57:07,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 19:57:07,693 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 19:57:07,693 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 19:57:07,694 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt3.c [2022-04-14 19:57:07,732 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bc3dc4c9/b52ec31bb1084575bf9c40be2c89ee72/FLAG86d277bbb [2022-04-14 19:57:08,046 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 19:57:08,047 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt3.c [2022-04-14 19:57:08,052 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bc3dc4c9/b52ec31bb1084575bf9c40be2c89ee72/FLAG86d277bbb [2022-04-14 19:57:08,488 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bc3dc4c9/b52ec31bb1084575bf9c40be2c89ee72 [2022-04-14 19:57:08,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 19:57:08,490 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 19:57:08,491 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 19:57:08,491 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 19:57:08,493 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 19:57:08,494 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 07:57:08" (1/1) ... [2022-04-14 19:57:08,495 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bdfe486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:57:08, skipping insertion in model container [2022-04-14 19:57:08,495 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 07:57:08" (1/1) ... [2022-04-14 19:57:08,501 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 19:57:08,510 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 19:57:08,652 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/sumt3.c[403,416] [2022-04-14 19:57:08,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 19:57:08,680 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 19:57:08,693 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/sumt3.c[403,416] [2022-04-14 19:57:08,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 19:57:08,712 INFO L208 MainTranslator]: Completed translation [2022-04-14 19:57:08,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:57:08 WrapperNode [2022-04-14 19:57:08,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 19:57:08,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 19:57:08,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 19:57:08,714 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 19:57:08,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:57:08" (1/1) ... [2022-04-14 19:57:08,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:57:08" (1/1) ... [2022-04-14 19:57:08,729 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:57:08" (1/1) ... [2022-04-14 19:57:08,730 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:57:08" (1/1) ... [2022-04-14 19:57:08,743 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:57:08" (1/1) ... [2022-04-14 19:57:08,746 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:57:08" (1/1) ... [2022-04-14 19:57:08,747 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:57:08" (1/1) ... [2022-04-14 19:57:08,748 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 19:57:08,749 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 19:57:08,749 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 19:57:08,749 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 19:57:08,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:57:08" (1/1) ... [2022-04-14 19:57:08,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 19:57:08,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 19:57:08,785 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-14 19:57:08,787 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-14 19:57:08,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 19:57:08,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 19:57:08,811 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 19:57:08,811 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 19:57:08,811 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 19:57:08,812 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 19:57:08,812 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 19:57:08,812 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 19:57:08,812 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 19:57:08,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 19:57:08,813 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 19:57:08,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 19:57:08,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-14 19:57:08,814 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 19:57:08,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 19:57:08,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 19:57:08,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 19:57:08,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 19:57:08,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 19:57:08,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 19:57:08,869 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 19:57:08,870 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 19:57:11,173 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 19:57:11,177 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 19:57:11,177 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 19:57:11,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 07:57:11 BoogieIcfgContainer [2022-04-14 19:57:11,179 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 19:57:11,179 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 19:57:11,179 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 19:57:11,180 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 19:57:11,182 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 07:57:11" (1/1) ... [2022-04-14 19:57:11,183 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 19:57:11,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 07:57:11 BasicIcfg [2022-04-14 19:57:11,195 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 19:57:11,196 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 19:57:11,196 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 19:57:11,198 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 19:57:11,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 07:57:08" (1/4) ... [2022-04-14 19:57:11,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26acfe1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 07:57:11, skipping insertion in model container [2022-04-14 19:57:11,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:57:08" (2/4) ... [2022-04-14 19:57:11,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26acfe1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 07:57:11, skipping insertion in model container [2022-04-14 19:57:11,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 07:57:11" (3/4) ... [2022-04-14 19:57:11,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26acfe1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 07:57:11, skipping insertion in model container [2022-04-14 19:57:11,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 07:57:11" (4/4) ... [2022-04-14 19:57:11,211 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt3.cJordan [2022-04-14 19:57:11,214 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 19:57:11,215 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 19:57:11,239 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 19:57:11,243 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-14 19:57:11,244 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 19:57:11,254 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 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-14 19:57:11,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 19:57:11,258 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:57:11,258 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:57:11,259 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:57:11,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:57:11,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1944242814, now seen corresponding path program 1 times [2022-04-14 19:57:11,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:57:11,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017364383] [2022-04-14 19:57:11,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:57:11,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:57:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:57:11,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:57:11,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:57:11,464 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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_3, #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] {26#true} is VALID [2022-04-14 19:57:11,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-14 19:57:11,465 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-14 19:57:11,466 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 19:57:11,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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_3, #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] {26#true} is VALID [2022-04-14 19:57:11,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-14 19:57:11,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-14 19:57:11,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-14 19:57:11,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} [68] mainENTRY-->L19: Formula: (and (= v_main_~l~0_5 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_5, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {26#true} is VALID [2022-04-14 19:57:11,469 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} [71] L19-->L24-2: Formula: (and (= v_main_~i~0_3 0) (= v_main_~j~0_3 0) (= v_main_~k~0_5 0) (= v_main_~l~0_6 0) (<= (mod v_main_~n~0_5 4294967296) (mod v_~SIZE~0_2 4294967296))) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_5} OutVars{~SIZE~0=v_~SIZE~0_2, main_~l~0=v_main_~l~0_6, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[main_~l~0, main_~k~0, main_~j~0, main_~i~0] {26#true} is VALID [2022-04-14 19:57:11,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#true} [73] L24-2-->L24-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-14 19:57:11,470 INFO L272 TraceCheckUtils]: 8: Hoare triple {27#false} [76] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_12 4294967296) (mod (+ v_main_~i~0_6 v_main_~j~0_6 v_main_~k~0_6) 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_6, main_~l~0=v_main_~l~0_12, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {27#false} is VALID [2022-04-14 19:57:11,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} [80] __VERIFIER_assertENTRY-->L9: 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] {27#false} is VALID [2022-04-14 19:57:11,470 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} [84] L9-->L10: 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[] {27#false} is VALID [2022-04-14 19:57:11,470 INFO L290 TraceCheckUtils]: 11: Hoare triple {27#false} [86] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-14 19:57:11,471 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-14 19:57:11,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:57:11,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017364383] [2022-04-14 19:57:11,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017364383] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:57:11,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 19:57:11,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 19:57:11,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569419850] [2022-04-14 19:57:11,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:57:11,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-14 19:57:11,479 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:57:11,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-14 19:57:11,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:57:11,497 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 19:57:11,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:57:11,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 19:57:11,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 19:57:11,519 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 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.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-14 19:57:13,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:57:13,811 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-14 19:57:13,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 19:57:13,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-14 19:57:13,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:57:13,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-14 19:57:13,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-04-14 19:57:13,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-14 19:57:13,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-04-14 19:57:13,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 28 transitions. [2022-04-14 19:57:13,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:57:13,868 INFO L225 Difference]: With dead ends: 23 [2022-04-14 19:57:13,868 INFO L226 Difference]: Without dead ends: 16 [2022-04-14 19:57:13,869 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-04-14 19:57:13,872 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 26 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-14 19:57:13,872 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 26 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 19:57:13,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-14 19:57:13,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-14 19:57:13,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:57:13,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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-14 19:57:13,889 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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-14 19:57:13,889 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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-14 19:57:13,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:57:13,891 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-14 19:57:13,891 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-14 19:57:13,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:57:13,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:57:13,892 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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 16 states. [2022-04-14 19:57:13,892 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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 16 states. [2022-04-14 19:57:13,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:57:13,894 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-14 19:57:13,894 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-14 19:57:13,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:57:13,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:57:13,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:57:13,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:57:13,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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-14 19:57:13,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-14 19:57:13,896 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2022-04-14 19:57:13,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:57:13,897 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-14 19:57:13,897 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-14 19:57:13,897 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-14 19:57:13,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 19:57:13,897 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:57:13,897 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:57:13,898 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 19:57:13,898 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:57:13,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:57:13,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1943319293, now seen corresponding path program 1 times [2022-04-14 19:57:13,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:57:13,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267447556] [2022-04-14 19:57:13,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:57:13,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:57:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:57:14,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:57:14,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:57:14,075 INFO L290 TraceCheckUtils]: 0: Hoare triple {113#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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_3, #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] {105#true} is VALID [2022-04-14 19:57:14,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {105#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {105#true} is VALID [2022-04-14 19:57:14,075 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {105#true} {105#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {105#true} is VALID [2022-04-14 19:57:14,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {105#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {113#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 19:57:14,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {113#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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_3, #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] {105#true} is VALID [2022-04-14 19:57:14,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {105#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {105#true} is VALID [2022-04-14 19:57:14,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {105#true} {105#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {105#true} is VALID [2022-04-14 19:57:14,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {105#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {105#true} is VALID [2022-04-14 19:57:14,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {105#true} [68] mainENTRY-->L19: Formula: (and (= v_main_~l~0_5 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_5, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {105#true} is VALID [2022-04-14 19:57:14,077 INFO L290 TraceCheckUtils]: 6: Hoare triple {105#true} [71] L19-->L24-2: Formula: (and (= v_main_~i~0_3 0) (= v_main_~j~0_3 0) (= v_main_~k~0_5 0) (= v_main_~l~0_6 0) (<= (mod v_main_~n~0_5 4294967296) (mod v_~SIZE~0_2 4294967296))) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_5} OutVars{~SIZE~0=v_~SIZE~0_2, main_~l~0=v_main_~l~0_6, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[main_~l~0, main_~k~0, main_~j~0, main_~i~0] {110#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-14 19:57:14,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {110#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} [74] L24-2-->L24-3: Formula: (not (< (mod v_main_~l~0_7 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {110#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-14 19:57:14,079 INFO L272 TraceCheckUtils]: 8: Hoare triple {110#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} [76] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_12 4294967296) (mod (+ v_main_~i~0_6 v_main_~j~0_6 v_main_~k~0_6) 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_6, main_~l~0=v_main_~l~0_12, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 19:57:14,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {111#(not (= |__VERIFIER_assert_#in~cond| 0))} [80] __VERIFIER_assertENTRY-->L9: 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] {112#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 19:57:14,080 INFO L290 TraceCheckUtils]: 10: Hoare triple {112#(not (= __VERIFIER_assert_~cond 0))} [84] L9-->L10: 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[] {106#false} is VALID [2022-04-14 19:57:14,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {106#false} [86] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {106#false} is VALID [2022-04-14 19:57:14,080 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-14 19:57:14,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:57:14,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267447556] [2022-04-14 19:57:14,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267447556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:57:14,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 19:57:14,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 19:57:14,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520152713] [2022-04-14 19:57:14,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:57:14,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 12 [2022-04-14 19:57:14,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:57:14,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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-14 19:57:14,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:57:14,092 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 19:57:14,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:57:14,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 19:57:14,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 19:57:14,093 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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-14 19:57:16,182 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-04-14 19:57:16,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:57:16,416 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-14 19:57:16,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 19:57:16,416 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 12 [2022-04-14 19:57:16,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:57:16,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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-14 19:57:16,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2022-04-14 19:57:16,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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-14 19:57:16,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2022-04-14 19:57:16,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 25 transitions. [2022-04-14 19:57:16,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:57:16,450 INFO L225 Difference]: With dead ends: 21 [2022-04-14 19:57:16,450 INFO L226 Difference]: Without dead ends: 18 [2022-04-14 19:57:16,450 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-14 19:57:16,451 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-14 19:57:16,452 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 33 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-14 19:57:16,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-14 19:57:16,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-04-14 19:57:16,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:57:16,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second 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-04-14 19:57:16,454 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second 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-04-14 19:57:16,454 INFO L87 Difference]: Start difference. First operand 18 states. Second 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-04-14 19:57:16,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:57:16,458 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-04-14 19:57:16,458 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-14 19:57:16,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:57:16,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:57:16,459 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 18 states. [2022-04-14 19:57:16,459 INFO L87 Difference]: Start difference. First 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) Second operand 18 states. [2022-04-14 19:57:16,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:57:16,460 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-04-14 19:57:16,460 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-14 19:57:16,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:57:16,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:57:16,461 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:57:16,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:57:16,461 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-04-14 19:57:16,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-14 19:57:16,462 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2022-04-14 19:57:16,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:57:16,463 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-14 19:57:16,463 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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-14 19:57:16,463 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-14 19:57:16,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-14 19:57:16,464 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:57:16,464 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:57:16,464 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 19:57:16,464 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:57:16,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:57:16,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1088614638, now seen corresponding path program 1 times [2022-04-14 19:57:16,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:57:16,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714029802] [2022-04-14 19:57:16,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:57:16,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:57:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:57:16,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:57:16,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:57:16,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {208#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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_3, #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] {196#true} is VALID [2022-04-14 19:57:16,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-14 19:57:16,816 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {196#true} {196#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-14 19:57:16,817 INFO L272 TraceCheckUtils]: 0: Hoare triple {196#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 19:57:16,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {208#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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_3, #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] {196#true} is VALID [2022-04-14 19:57:16,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {196#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-14 19:57:16,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {196#true} {196#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-14 19:57:16,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {196#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-14 19:57:16,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {196#true} [68] mainENTRY-->L19: Formula: (and (= v_main_~l~0_5 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_5, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {196#true} is VALID [2022-04-14 19:57:16,818 INFO L290 TraceCheckUtils]: 6: Hoare triple {196#true} [71] L19-->L24-2: Formula: (and (= v_main_~i~0_3 0) (= v_main_~j~0_3 0) (= v_main_~k~0_5 0) (= v_main_~l~0_6 0) (<= (mod v_main_~n~0_5 4294967296) (mod v_~SIZE~0_2 4294967296))) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_5} OutVars{~SIZE~0=v_~SIZE~0_2, main_~l~0=v_main_~l~0_6, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[main_~l~0, main_~k~0, main_~j~0, main_~i~0] {201#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-14 19:57:16,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {201#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} [75] L24-2-->L26: Formula: (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_7 4294967296)) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {202#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0))} is VALID [2022-04-14 19:57:16,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {202#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0))} [77] L26-->L28-2: Formula: (and (= (mod (mod (mod v_main_~l~0_9 4294967296) 3) 4294967296) 0) (= v_main_~i~0_4 (+ v_main_~i~0_5 1))) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_9} OutVars{main_~i~0=v_main_~i~0_4, main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~i~0] {203#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~i~0 main_~n~0)) (= main_~k~0 0) (<= main_~i~0 1) (= main_~j~0 0) (= main_~l~0 0) (<= 1 main_~i~0))} is VALID [2022-04-14 19:57:16,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {203#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~i~0 main_~n~0)) (= main_~k~0 0) (<= main_~i~0 1) (= main_~j~0 0) (= main_~l~0 0) (<= 1 main_~i~0))} [81] L28-2-->L24-2: Formula: (= v_main_~l~0_2 (+ v_main_~l~0_3 1)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_2} AuxVars[] AssignedVars[main_~l~0] {204#(and (= main_~k~0 0) (= main_~j~0 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1)) (or (and (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~i~0 main_~n~0)) (not (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))))) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))))} is VALID [2022-04-14 19:57:16,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {204#(and (= main_~k~0 0) (= main_~j~0 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1)) (or (and (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~i~0 main_~n~0)) (not (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))))) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))))} [74] L24-2-->L24-3: Formula: (not (< (mod v_main_~l~0_7 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {205#(and (= main_~k~0 0) (= main_~j~0 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1)) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)))) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))))} is VALID [2022-04-14 19:57:16,824 INFO L272 TraceCheckUtils]: 11: Hoare triple {205#(and (= main_~k~0 0) (= main_~j~0 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1)) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)))) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))))} [76] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_12 4294967296) (mod (+ v_main_~i~0_6 v_main_~j~0_6 v_main_~k~0_6) 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_6, main_~l~0=v_main_~l~0_12, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {206#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 19:57:16,824 INFO L290 TraceCheckUtils]: 12: Hoare triple {206#(not (= |__VERIFIER_assert_#in~cond| 0))} [80] __VERIFIER_assertENTRY-->L9: 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] {207#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 19:57:16,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {207#(not (= __VERIFIER_assert_~cond 0))} [84] L9-->L10: 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[] {197#false} is VALID [2022-04-14 19:57:16,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {197#false} [86] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#false} is VALID [2022-04-14 19:57:16,825 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-14 19:57:16,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:57:16,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714029802] [2022-04-14 19:57:16,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714029802] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 19:57:16,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222611476] [2022-04-14 19:57:16,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:57:16,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 19:57:16,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 19:57:16,827 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-14 19:57:16,835 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-14 19:57:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:57:16,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-14 19:57:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:57:16,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 19:57:17,091 INFO L272 TraceCheckUtils]: 0: Hoare triple {196#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-14 19:57:17,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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_3, #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] {196#true} is VALID [2022-04-14 19:57:17,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {196#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-14 19:57:17,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {196#true} {196#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-14 19:57:17,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {196#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-14 19:57:17,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {196#true} [68] mainENTRY-->L19: Formula: (and (= v_main_~l~0_5 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_5, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {196#true} is VALID [2022-04-14 19:57:17,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {196#true} [71] L19-->L24-2: Formula: (and (= v_main_~i~0_3 0) (= v_main_~j~0_3 0) (= v_main_~k~0_5 0) (= v_main_~l~0_6 0) (<= (mod v_main_~n~0_5 4294967296) (mod v_~SIZE~0_2 4294967296))) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_5} OutVars{~SIZE~0=v_~SIZE~0_2, main_~l~0=v_main_~l~0_6, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[main_~l~0, main_~k~0, main_~j~0, main_~i~0] {201#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-14 19:57:17,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {201#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} [75] L24-2-->L26: Formula: (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_7 4294967296)) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {201#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-14 19:57:17,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {201#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} [77] L26-->L28-2: Formula: (and (= (mod (mod (mod v_main_~l~0_9 4294967296) 3) 4294967296) 0) (= v_main_~i~0_4 (+ v_main_~i~0_5 1))) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_9} OutVars{main_~i~0=v_main_~i~0_4, main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~i~0] {236#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-14 19:57:17,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {236#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= (+ (- 1) main_~i~0) 0))} [81] L28-2-->L24-2: Formula: (= v_main_~l~0_2 (+ v_main_~l~0_3 1)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_2} AuxVars[] AssignedVars[main_~l~0] {240#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-14 19:57:17,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {240#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= (+ (- 1) main_~i~0) 0))} [74] L24-2-->L24-3: Formula: (not (< (mod v_main_~l~0_7 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {240#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-14 19:57:17,096 INFO L272 TraceCheckUtils]: 11: Hoare triple {240#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= (+ (- 1) main_~i~0) 0))} [76] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_12 4294967296) (mod (+ v_main_~i~0_6 v_main_~j~0_6 v_main_~k~0_6) 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_6, main_~l~0=v_main_~l~0_12, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {247#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 19:57:17,097 INFO L290 TraceCheckUtils]: 12: Hoare triple {247#(<= 1 |__VERIFIER_assert_#in~cond|)} [80] __VERIFIER_assertENTRY-->L9: 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] {251#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 19:57:17,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {251#(<= 1 __VERIFIER_assert_~cond)} [84] L9-->L10: 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[] {197#false} is VALID [2022-04-14 19:57:17,097 INFO L290 TraceCheckUtils]: 14: Hoare triple {197#false} [86] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#false} is VALID [2022-04-14 19:57:17,098 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-14 19:57:17,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 19:57:17,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {197#false} [86] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#false} is VALID [2022-04-14 19:57:17,301 INFO L290 TraceCheckUtils]: 13: Hoare triple {251#(<= 1 __VERIFIER_assert_~cond)} [84] L9-->L10: 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[] {197#false} is VALID [2022-04-14 19:57:17,301 INFO L290 TraceCheckUtils]: 12: Hoare triple {247#(<= 1 |__VERIFIER_assert_#in~cond|)} [80] __VERIFIER_assertENTRY-->L9: 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] {251#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 19:57:17,302 INFO L272 TraceCheckUtils]: 11: Hoare triple {267#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} [76] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_12 4294967296) (mod (+ v_main_~i~0_6 v_main_~j~0_6 v_main_~k~0_6) 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_6, main_~l~0=v_main_~l~0_12, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {247#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 19:57:17,303 INFO L290 TraceCheckUtils]: 10: Hoare triple {267#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} [74] L24-2-->L24-3: Formula: (not (< (mod v_main_~l~0_7 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {267#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:17,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {274#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [81] L28-2-->L24-2: Formula: (= v_main_~l~0_2 (+ v_main_~l~0_3 1)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_2} AuxVars[] AssignedVars[main_~l~0] {267#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:19,402 WARN L290 TraceCheckUtils]: 8: Hoare triple {267#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} [77] L26-->L28-2: Formula: (and (= (mod (mod (mod v_main_~l~0_9 4294967296) 3) 4294967296) 0) (= v_main_~i~0_4 (+ v_main_~i~0_5 1))) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_9} OutVars{main_~i~0=v_main_~i~0_4, main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~i~0] {274#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 19:57:19,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {267#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} [75] L24-2-->L26: Formula: (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_7 4294967296)) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {267#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:19,403 INFO L290 TraceCheckUtils]: 6: Hoare triple {196#true} [71] L19-->L24-2: Formula: (and (= v_main_~i~0_3 0) (= v_main_~j~0_3 0) (= v_main_~k~0_5 0) (= v_main_~l~0_6 0) (<= (mod v_main_~n~0_5 4294967296) (mod v_~SIZE~0_2 4294967296))) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_5} OutVars{~SIZE~0=v_~SIZE~0_2, main_~l~0=v_main_~l~0_6, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[main_~l~0, main_~k~0, main_~j~0, main_~i~0] {267#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:19,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {196#true} [68] mainENTRY-->L19: Formula: (and (= v_main_~l~0_5 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_5, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {196#true} is VALID [2022-04-14 19:57:19,404 INFO L272 TraceCheckUtils]: 4: Hoare triple {196#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-14 19:57:19,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {196#true} {196#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-14 19:57:19,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {196#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-14 19:57:19,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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_3, #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] {196#true} is VALID [2022-04-14 19:57:19,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {196#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-14 19:57:19,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-14 19:57:19,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222611476] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 19:57:19,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 19:57:19,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 7] total 16 [2022-04-14 19:57:19,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756494625] [2022-04-14 19:57:19,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:57:19,406 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 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 15 [2022-04-14 19:57:19,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:57:19,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 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-14 19:57:21,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 14 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 19:57:21,526 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 19:57:21,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:57:21,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 19:57:21,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-14 19:57:21,527 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 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-14 19:57:23,575 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-04-14 19:57:26,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:57:26,054 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-14 19:57:26,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 19:57:26,054 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 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 15 [2022-04-14 19:57:26,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:57:26,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 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-14 19:57:26,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-14 19:57:26,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 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-14 19:57:26,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-14 19:57:26,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2022-04-14 19:57:28,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 25 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 19:57:28,218 INFO L225 Difference]: With dead ends: 23 [2022-04-14 19:57:28,218 INFO L226 Difference]: Without dead ends: 20 [2022-04-14 19:57:28,218 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-04-14 19:57:28,219 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-14 19:57:28,219 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 47 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-14 19:57:28,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-14 19:57:28,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-04-14 19:57:28,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:57:28,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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-14 19:57:28,222 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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-14 19:57:28,222 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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-14 19:57:28,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:57:28,223 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-14 19:57:28,224 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-14 19:57:28,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:57:28,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:57:28,224 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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 20 states. [2022-04-14 19:57:28,224 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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 20 states. [2022-04-14 19:57:28,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:57:28,226 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-14 19:57:28,227 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-14 19:57:28,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:57:28,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:57:28,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:57:28,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:57:28,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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-14 19:57:28,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-04-14 19:57:28,228 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 15 [2022-04-14 19:57:28,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:57:28,228 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-04-14 19:57:28,229 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 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-14 19:57:28,229 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-14 19:57:28,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-14 19:57:28,229 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:57:28,229 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:57:28,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-14 19:57:28,451 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-04-14 19:57:28,451 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:57:28,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:57:28,452 INFO L85 PathProgramCache]: Analyzing trace with hash -2078903839, now seen corresponding path program 1 times [2022-04-14 19:57:28,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:57:28,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219989507] [2022-04-14 19:57:28,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:57:28,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:57:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:57:28,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:57:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:57:28,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {394#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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_3, #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] {388#true} is VALID [2022-04-14 19:57:28,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {388#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {388#true} is VALID [2022-04-14 19:57:28,637 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {388#true} {388#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {388#true} is VALID [2022-04-14 19:57:28,638 INFO L272 TraceCheckUtils]: 0: Hoare triple {388#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 19:57:28,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {394#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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_3, #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] {388#true} is VALID [2022-04-14 19:57:28,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {388#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {388#true} is VALID [2022-04-14 19:57:28,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {388#true} {388#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {388#true} is VALID [2022-04-14 19:57:28,639 INFO L272 TraceCheckUtils]: 4: Hoare triple {388#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {388#true} is VALID [2022-04-14 19:57:28,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {388#true} [68] mainENTRY-->L19: Formula: (and (= v_main_~l~0_5 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_5, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {388#true} is VALID [2022-04-14 19:57:28,640 INFO L290 TraceCheckUtils]: 6: Hoare triple {388#true} [71] L19-->L24-2: Formula: (and (= v_main_~i~0_3 0) (= v_main_~j~0_3 0) (= v_main_~k~0_5 0) (= v_main_~l~0_6 0) (<= (mod v_main_~n~0_5 4294967296) (mod v_~SIZE~0_2 4294967296))) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_5} OutVars{~SIZE~0=v_~SIZE~0_2, main_~l~0=v_main_~l~0_6, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[main_~l~0, main_~k~0, main_~j~0, main_~i~0] {393#(= main_~l~0 0)} is VALID [2022-04-14 19:57:28,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {393#(= main_~l~0 0)} [75] L24-2-->L26: Formula: (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_7 4294967296)) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {393#(= main_~l~0 0)} is VALID [2022-04-14 19:57:28,641 INFO L290 TraceCheckUtils]: 8: Hoare triple {393#(= main_~l~0 0)} [78] L26-->L28: Formula: (not (= (mod (mod (mod v_main_~l~0_10 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_10} AuxVars[] AssignedVars[] {389#false} is VALID [2022-04-14 19:57:28,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {389#false} [82] L28-->L28-2: Formula: (and (= (mod v_main_~l~0_11 2) 0) (= v_main_~j~0_4 (+ v_main_~j~0_5 1))) InVars {main_~l~0=v_main_~l~0_11, main_~j~0=v_main_~j~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {389#false} is VALID [2022-04-14 19:57:28,642 INFO L290 TraceCheckUtils]: 10: Hoare triple {389#false} [81] L28-2-->L24-2: Formula: (= v_main_~l~0_2 (+ v_main_~l~0_3 1)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_2} AuxVars[] AssignedVars[main_~l~0] {389#false} is VALID [2022-04-14 19:57:28,642 INFO L290 TraceCheckUtils]: 11: Hoare triple {389#false} [74] L24-2-->L24-3: Formula: (not (< (mod v_main_~l~0_7 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {389#false} is VALID [2022-04-14 19:57:28,642 INFO L272 TraceCheckUtils]: 12: Hoare triple {389#false} [76] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_12 4294967296) (mod (+ v_main_~i~0_6 v_main_~j~0_6 v_main_~k~0_6) 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_6, main_~l~0=v_main_~l~0_12, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {389#false} is VALID [2022-04-14 19:57:28,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {389#false} [80] __VERIFIER_assertENTRY-->L9: 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] {389#false} is VALID [2022-04-14 19:57:28,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {389#false} [84] L9-->L10: 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[] {389#false} is VALID [2022-04-14 19:57:28,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {389#false} [86] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {389#false} is VALID [2022-04-14 19:57:28,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 19:57:28,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:57:28,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219989507] [2022-04-14 19:57:28,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219989507] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:57:28,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 19:57:28,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 19:57:28,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129531957] [2022-04-14 19:57:28,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:57:28,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-04-14 19:57:28,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:57:28,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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-04-14 19:57:30,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 15 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 19:57:30,832 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 19:57:30,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:57:30,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 19:57:30,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 19:57:30,833 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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-04-14 19:57:35,032 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-04-14 19:57:35,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:57:35,251 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-14 19:57:35,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 19:57:35,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-04-14 19:57:35,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:57:35,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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-04-14 19:57:35,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-04-14 19:57:35,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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-04-14 19:57:35,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-04-14 19:57:35,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 22 transitions. [2022-04-14 19:57:37,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 21 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 19:57:37,439 INFO L225 Difference]: With dead ends: 22 [2022-04-14 19:57:37,439 INFO L226 Difference]: Without dead ends: 22 [2022-04-14 19:57:37,440 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-14 19:57:37,440 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-14 19:57:37,441 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 21 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-04-14 19:57:37,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-14 19:57:37,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-14 19:57:37,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:57:37,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second 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-04-14 19:57:37,443 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second 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-04-14 19:57:37,444 INFO L87 Difference]: Start difference. First operand 22 states. Second 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-04-14 19:57:37,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:57:37,445 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-14 19:57:37,445 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-14 19:57:37,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:57:37,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:57:37,445 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 22 states. [2022-04-14 19:57:37,445 INFO L87 Difference]: Start difference. First 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) Second operand 22 states. [2022-04-14 19:57:37,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:57:37,446 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-14 19:57:37,446 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-14 19:57:37,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:57:37,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:57:37,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:57:37,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:57:37,447 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-04-14 19:57:37,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-04-14 19:57:37,448 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2022-04-14 19:57:37,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:57:37,448 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-04-14 19:57:37,448 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-14 19:57:37,448 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-14 19:57:37,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-14 19:57:37,449 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:57:37,449 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:57:37,449 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-14 19:57:37,449 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:57:37,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:57:37,450 INFO L85 PathProgramCache]: Analyzing trace with hash 187967564, now seen corresponding path program 1 times [2022-04-14 19:57:37,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:57:37,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332015674] [2022-04-14 19:57:37,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:57:37,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:57:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:57:37,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:57:37,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:57:37,516 INFO L290 TraceCheckUtils]: 0: Hoare triple {494#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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_3, #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] {487#true} is VALID [2022-04-14 19:57:37,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {487#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {487#true} is VALID [2022-04-14 19:57:37,516 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {487#true} {487#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {487#true} is VALID [2022-04-14 19:57:37,517 INFO L272 TraceCheckUtils]: 0: Hoare triple {487#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {494#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 19:57:37,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {494#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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_3, #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] {487#true} is VALID [2022-04-14 19:57:37,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {487#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {487#true} is VALID [2022-04-14 19:57:37,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {487#true} {487#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {487#true} is VALID [2022-04-14 19:57:37,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {487#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {487#true} is VALID [2022-04-14 19:57:37,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {487#true} [68] mainENTRY-->L19: Formula: (and (= v_main_~l~0_5 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_5, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {487#true} is VALID [2022-04-14 19:57:37,518 INFO L290 TraceCheckUtils]: 6: Hoare triple {487#true} [71] L19-->L24-2: Formula: (and (= v_main_~i~0_3 0) (= v_main_~j~0_3 0) (= v_main_~k~0_5 0) (= v_main_~l~0_6 0) (<= (mod v_main_~n~0_5 4294967296) (mod v_~SIZE~0_2 4294967296))) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_5} OutVars{~SIZE~0=v_~SIZE~0_2, main_~l~0=v_main_~l~0_6, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[main_~l~0, main_~k~0, main_~j~0, main_~i~0] {492#(= main_~l~0 0)} is VALID [2022-04-14 19:57:37,518 INFO L290 TraceCheckUtils]: 7: Hoare triple {492#(= main_~l~0 0)} [75] L24-2-->L26: Formula: (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_7 4294967296)) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {492#(= main_~l~0 0)} is VALID [2022-04-14 19:57:37,518 INFO L290 TraceCheckUtils]: 8: Hoare triple {492#(= main_~l~0 0)} [77] L26-->L28-2: Formula: (and (= (mod (mod (mod v_main_~l~0_9 4294967296) 3) 4294967296) 0) (= v_main_~i~0_4 (+ v_main_~i~0_5 1))) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_9} OutVars{main_~i~0=v_main_~i~0_4, main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~i~0] {492#(= main_~l~0 0)} is VALID [2022-04-14 19:57:37,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {492#(= main_~l~0 0)} [81] L28-2-->L24-2: Formula: (= v_main_~l~0_2 (+ v_main_~l~0_3 1)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_2} AuxVars[] AssignedVars[main_~l~0] {493#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 19:57:37,519 INFO L290 TraceCheckUtils]: 10: Hoare triple {493#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [75] L24-2-->L26: Formula: (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_7 4294967296)) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {493#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 19:57:37,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {493#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [78] L26-->L28: Formula: (not (= (mod (mod (mod v_main_~l~0_10 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_10} AuxVars[] AssignedVars[] {493#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 19:57:37,520 INFO L290 TraceCheckUtils]: 12: Hoare triple {493#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [82] L28-->L28-2: Formula: (and (= (mod v_main_~l~0_11 2) 0) (= v_main_~j~0_4 (+ v_main_~j~0_5 1))) InVars {main_~l~0=v_main_~l~0_11, main_~j~0=v_main_~j~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {488#false} is VALID [2022-04-14 19:57:37,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {488#false} [81] L28-2-->L24-2: Formula: (= v_main_~l~0_2 (+ v_main_~l~0_3 1)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_2} AuxVars[] AssignedVars[main_~l~0] {488#false} is VALID [2022-04-14 19:57:37,521 INFO L290 TraceCheckUtils]: 14: Hoare triple {488#false} [74] L24-2-->L24-3: Formula: (not (< (mod v_main_~l~0_7 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {488#false} is VALID [2022-04-14 19:57:37,521 INFO L272 TraceCheckUtils]: 15: Hoare triple {488#false} [76] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_12 4294967296) (mod (+ v_main_~i~0_6 v_main_~j~0_6 v_main_~k~0_6) 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_6, main_~l~0=v_main_~l~0_12, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {488#false} is VALID [2022-04-14 19:57:37,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {488#false} [80] __VERIFIER_assertENTRY-->L9: 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] {488#false} is VALID [2022-04-14 19:57:37,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {488#false} [84] L9-->L10: 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[] {488#false} is VALID [2022-04-14 19:57:37,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {488#false} [86] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {488#false} is VALID [2022-04-14 19:57:37,521 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 19:57:37,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:57:37,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332015674] [2022-04-14 19:57:37,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332015674] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 19:57:37,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846548489] [2022-04-14 19:57:37,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:57:37,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 19:57:37,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 19:57:37,523 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-14 19:57:37,526 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-14 19:57:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:57:37,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-14 19:57:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:57:37,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 19:57:37,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {487#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {487#true} is VALID [2022-04-14 19:57:37,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {487#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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_3, #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] {487#true} is VALID [2022-04-14 19:57:37,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {487#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {487#true} is VALID [2022-04-14 19:57:37,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {487#true} {487#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {487#true} is VALID [2022-04-14 19:57:37,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {487#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {487#true} is VALID [2022-04-14 19:57:37,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {487#true} [68] mainENTRY-->L19: Formula: (and (= v_main_~l~0_5 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_5, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {487#true} is VALID [2022-04-14 19:57:37,799 INFO L290 TraceCheckUtils]: 6: Hoare triple {487#true} [71] L19-->L24-2: Formula: (and (= v_main_~i~0_3 0) (= v_main_~j~0_3 0) (= v_main_~k~0_5 0) (= v_main_~l~0_6 0) (<= (mod v_main_~n~0_5 4294967296) (mod v_~SIZE~0_2 4294967296))) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_5} OutVars{~SIZE~0=v_~SIZE~0_2, main_~l~0=v_main_~l~0_6, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[main_~l~0, main_~k~0, main_~j~0, main_~i~0] {516#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-14 19:57:37,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {516#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} [75] L24-2-->L26: Formula: (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_7 4294967296)) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {516#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-14 19:57:37,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {516#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} [77] L26-->L28-2: Formula: (and (= (mod (mod (mod v_main_~l~0_9 4294967296) 3) 4294967296) 0) (= v_main_~i~0_4 (+ v_main_~i~0_5 1))) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_9} OutVars{main_~i~0=v_main_~i~0_4, main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~i~0] {523#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-14 19:57:37,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {523#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= (+ (- 1) main_~i~0) 0))} [81] L28-2-->L24-2: Formula: (= v_main_~l~0_2 (+ v_main_~l~0_3 1)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_2} AuxVars[] AssignedVars[main_~l~0] {527#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-14 19:57:37,802 INFO L290 TraceCheckUtils]: 10: Hoare triple {527#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~i~0) 0))} [75] L24-2-->L26: Formula: (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_7 4294967296)) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {527#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-14 19:57:37,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {527#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~i~0) 0))} [78] L26-->L28: Formula: (not (= (mod (mod (mod v_main_~l~0_10 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_10} AuxVars[] AssignedVars[] {527#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-14 19:57:37,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {527#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~i~0) 0))} [82] L28-->L28-2: Formula: (and (= (mod v_main_~l~0_11 2) 0) (= v_main_~j~0_4 (+ v_main_~j~0_5 1))) InVars {main_~l~0=v_main_~l~0_11, main_~j~0=v_main_~j~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {537#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-14 19:57:37,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {537#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~i~0) 0))} [81] L28-2-->L24-2: Formula: (= v_main_~l~0_2 (+ v_main_~l~0_3 1)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_2} AuxVars[] AssignedVars[main_~l~0] {541#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-14 19:57:37,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {541#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= (+ (- 1) main_~i~0) 0))} [74] L24-2-->L24-3: Formula: (not (< (mod v_main_~l~0_7 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {541#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-14 19:57:37,805 INFO L272 TraceCheckUtils]: 15: Hoare triple {541#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= (+ (- 1) main_~i~0) 0))} [76] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_12 4294967296) (mod (+ v_main_~i~0_6 v_main_~j~0_6 v_main_~k~0_6) 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_6, main_~l~0=v_main_~l~0_12, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {548#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 19:57:37,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {548#(<= 1 |__VERIFIER_assert_#in~cond|)} [80] __VERIFIER_assertENTRY-->L9: 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] {552#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 19:57:37,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {552#(<= 1 __VERIFIER_assert_~cond)} [84] L9-->L10: 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[] {488#false} is VALID [2022-04-14 19:57:37,806 INFO L290 TraceCheckUtils]: 18: Hoare triple {488#false} [86] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {488#false} is VALID [2022-04-14 19:57:37,806 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 19:57:37,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 19:57:38,045 INFO L290 TraceCheckUtils]: 18: Hoare triple {488#false} [86] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {488#false} is VALID [2022-04-14 19:57:38,045 INFO L290 TraceCheckUtils]: 17: Hoare triple {552#(<= 1 __VERIFIER_assert_~cond)} [84] L9-->L10: 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[] {488#false} is VALID [2022-04-14 19:57:38,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {548#(<= 1 |__VERIFIER_assert_#in~cond|)} [80] __VERIFIER_assertENTRY-->L9: 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] {552#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 19:57:38,047 INFO L272 TraceCheckUtils]: 15: Hoare triple {568#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} [76] L24-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_12 4294967296) (mod (+ v_main_~i~0_6 v_main_~j~0_6 v_main_~k~0_6) 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_6, main_~l~0=v_main_~l~0_12, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {548#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 19:57:38,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {568#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} [74] L24-2-->L24-3: Formula: (not (< (mod v_main_~l~0_7 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_7, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {568#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:38,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {575#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [81] L28-2-->L24-2: Formula: (= v_main_~l~0_2 (+ v_main_~l~0_3 1)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_2} AuxVars[] AssignedVars[main_~l~0] {568#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:38,055 INFO L290 TraceCheckUtils]: 12: Hoare triple {568#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} [82] L28-->L28-2: Formula: (and (= (mod v_main_~l~0_11 2) 0) (= v_main_~j~0_4 (+ v_main_~j~0_5 1))) InVars {main_~l~0=v_main_~l~0_11, main_~j~0=v_main_~j~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {575#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-14 19:57:38,055 INFO L290 TraceCheckUtils]: 11: Hoare triple {568#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} [78] L26-->L28: Formula: (not (= (mod (mod (mod v_main_~l~0_10 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_10} AuxVars[] AssignedVars[] {568#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:38,056 INFO L290 TraceCheckUtils]: 10: Hoare triple {568#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} [75] L24-2-->L26: Formula: (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_7 4294967296)) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {568#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:38,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {575#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [81] L28-2-->L24-2: Formula: (= v_main_~l~0_2 (+ v_main_~l~0_3 1)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_2} AuxVars[] AssignedVars[main_~l~0] {568#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:40,178 WARN L290 TraceCheckUtils]: 8: Hoare triple {568#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} [77] L26-->L28-2: Formula: (and (= (mod (mod (mod v_main_~l~0_9 4294967296) 3) 4294967296) 0) (= v_main_~i~0_4 (+ v_main_~i~0_5 1))) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_9} OutVars{main_~i~0=v_main_~i~0_4, main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~i~0] {575#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 19:57:40,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {568#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} [75] L24-2-->L26: Formula: (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_7 4294967296)) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {568#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:40,179 INFO L290 TraceCheckUtils]: 6: Hoare triple {487#true} [71] L19-->L24-2: Formula: (and (= v_main_~i~0_3 0) (= v_main_~j~0_3 0) (= v_main_~k~0_5 0) (= v_main_~l~0_6 0) (<= (mod v_main_~n~0_5 4294967296) (mod v_~SIZE~0_2 4294967296))) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_5} OutVars{~SIZE~0=v_~SIZE~0_2, main_~l~0=v_main_~l~0_6, main_~k~0=v_main_~k~0_5, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[main_~l~0, main_~k~0, main_~j~0, main_~i~0] {568#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:40,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {487#true} [68] mainENTRY-->L19: Formula: (and (= v_main_~l~0_5 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_5, main_~n~0=v_main_~n~0_1, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {487#true} is VALID [2022-04-14 19:57:40,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {487#true} [65] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {487#true} is VALID [2022-04-14 19:57:40,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {487#true} {487#true} [89] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {487#true} is VALID [2022-04-14 19:57:40,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {487#true} [69] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {487#true} is VALID [2022-04-14 19:57:40,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {487#true} [66] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (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_3, #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] {487#true} is VALID [2022-04-14 19:57:40,180 INFO L272 TraceCheckUtils]: 0: Hoare triple {487#true} [64] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {487#true} is VALID [2022-04-14 19:57:40,180 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-14 19:57:40,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846548489] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 19:57:40,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 19:57:40,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-14 19:57:40,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453498371] [2022-04-14 19:57:40,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:57:40,181 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 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 19 [2022-04-14 19:57:40,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:57:40,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 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-14 19:57:42,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 16 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 19:57:42,318 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 19:57:42,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:57:42,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 19:57:42,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-14 19:57:42,319 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 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-14 19:57:44,371 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-04-14 19:57:44,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:57:44,600 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-14 19:57:44,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 19:57:44,600 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 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 19 [2022-04-14 19:57:44,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:57:44,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 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-14 19:57:44,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2022-04-14 19:57:44,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 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-14 19:57:44,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2022-04-14 19:57:44,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 17 transitions. [2022-04-14 19:57:46,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 16 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 19:57:46,735 INFO L225 Difference]: With dead ends: 19 [2022-04-14 19:57:46,735 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 19:57:46,736 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-14 19:57:46,736 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-14 19:57:46,737 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 32 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-14 19:57:46,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 19:57:46,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 19:57:46,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:57:46,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second 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-04-14 19:57:46,739 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second 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-04-14 19:57:46,739 INFO L87 Difference]: Start difference. First operand 0 states. Second 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-04-14 19:57:46,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:57:46,739 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 19:57:46,739 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 19:57:46,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:57:46,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:57:46,739 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 0 states. [2022-04-14 19:57:46,739 INFO L87 Difference]: Start difference. First 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) Second operand 0 states. [2022-04-14 19:57:46,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:57:46,739 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 19:57:46,740 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 19:57:46,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:57:46,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:57:46,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:57:46,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:57:46,740 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-04-14 19:57:46,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 19:57:46,740 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2022-04-14 19:57:46,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:57:46,740 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 19:57:46,740 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 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-14 19:57:46,740 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 19:57:46,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:57:46,742 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 19:57:46,758 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-14 19:57:46,951 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 19:57:46,954 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-14 19:57:46,954 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 19:57:46,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 07:57:46 BasicIcfg [2022-04-14 19:57:46,956 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 19:57:46,957 INFO L158 Benchmark]: Toolchain (without parser) took 38466.50ms. Allocated memory was 174.1MB in the beginning and 215.0MB in the end (delta: 40.9MB). Free memory was 123.2MB in the beginning and 92.7MB in the end (delta: 30.5MB). Peak memory consumption was 72.6MB. Max. memory is 8.0GB. [2022-04-14 19:57:46,957 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 174.1MB. Free memory is still 139.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 19:57:46,957 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.98ms. Allocated memory is still 174.1MB. Free memory was 123.0MB in the beginning and 150.4MB in the end (delta: -27.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-14 19:57:46,957 INFO L158 Benchmark]: Boogie Preprocessor took 34.72ms. Allocated memory is still 174.1MB. Free memory was 150.3MB in the beginning and 148.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 19:57:46,957 INFO L158 Benchmark]: RCFGBuilder took 2429.95ms. Allocated memory is still 174.1MB. Free memory was 148.7MB in the beginning and 137.5MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-14 19:57:46,957 INFO L158 Benchmark]: IcfgTransformer took 15.91ms. Allocated memory is still 174.1MB. Free memory was 137.4MB in the beginning and 136.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-14 19:57:46,958 INFO L158 Benchmark]: TraceAbstraction took 35760.06ms. Allocated memory was 174.1MB in the beginning and 215.0MB in the end (delta: 40.9MB). Free memory was 135.5MB in the beginning and 92.7MB in the end (delta: 42.8MB). Peak memory consumption was 85.2MB. Max. memory is 8.0GB. [2022-04-14 19:57:46,961 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 174.1MB. Free memory is still 139.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 221.98ms. Allocated memory is still 174.1MB. Free memory was 123.0MB in the beginning and 150.4MB in the end (delta: -27.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.72ms. Allocated memory is still 174.1MB. Free memory was 150.3MB in the beginning and 148.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 2429.95ms. Allocated memory is still 174.1MB. Free memory was 148.7MB in the beginning and 137.5MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 15.91ms. Allocated memory is still 174.1MB. Free memory was 137.4MB in the beginning and 136.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 35760.06ms. Allocated memory was 174.1MB in the beginning and 215.0MB in the end (delta: 40.9MB). Free memory was 135.5MB in the beginning and 92.7MB in the end (delta: 42.8MB). Peak memory consumption was 85.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.7s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 22.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 8.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 47 mSDsluCounter, 159 SdHoareTripleChecker+Invalid, 8.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 90 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 127 IncrementalHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 69 mSDtfsCounter, 127 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 66 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, InterpolantAutomatonStates: 25, 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, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 108 NumberOfCodeBlocks, 108 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 133 ConstructedInterpolants, 0 QuantifiedInterpolants, 800 SizeOfPredicates, 2 NumberOfNonLiveVariables, 158 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 10/19 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-04-14 19:57:46,990 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...