/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/sumt5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 17:48:52,300 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 17:48:52,302 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 17:48:52,333 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 17:48:52,333 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 17:48:52,334 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 17:48:52,337 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 17:48:52,345 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 17:48:52,348 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 17:48:52,352 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 17:48:52,353 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 17:48:52,354 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 17:48:52,354 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 17:48:52,356 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 17:48:52,357 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 17:48:52,359 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 17:48:52,360 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 17:48:52,361 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 17:48:52,364 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 17:48:52,368 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 17:48:52,370 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 17:48:52,371 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 17:48:52,372 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 17:48:52,373 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 17:48:52,374 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 17:48:52,380 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 17:48:52,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 17:48:52,380 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 17:48:52,381 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 17:48:52,381 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 17:48:52,382 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 17:48:52,383 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 17:48:52,384 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 17:48:52,385 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 17:48:52,385 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 17:48:52,386 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 17:48:52,386 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 17:48:52,386 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 17:48:52,386 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 17:48:52,387 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 17:48:52,387 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 17:48:52,389 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 17:48:52,389 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 17:48:52,399 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 17:48:52,399 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 17:48:52,400 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 17:48:52,401 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 17:48:52,401 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 17:48:52,401 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 17:48:52,401 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 17:48:52,401 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 17:48:52,401 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 17:48:52,402 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 17:48:52,402 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 17:48:52,402 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 17:48:52,402 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 17:48:52,402 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 17:48:52,403 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 17:48:52,403 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 17:48:52,403 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 17:48:52,403 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 17:48:52,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 17:48:52,403 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 17:48:52,403 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 17:48:52,405 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 17:48:52,405 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-07 17:48:52,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 17:48:52,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 17:48:52,677 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 17:48:52,678 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 17:48:52,679 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 17:48:52,679 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt5.c [2022-04-07 17:48:52,733 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8d15e949/150250f3878e4b85b1493fc8b1e1bf73/FLAGa22787032 [2022-04-07 17:48:53,158 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 17:48:53,158 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt5.c [2022-04-07 17:48:53,164 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8d15e949/150250f3878e4b85b1493fc8b1e1bf73/FLAGa22787032 [2022-04-07 17:48:53,569 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8d15e949/150250f3878e4b85b1493fc8b1e1bf73 [2022-04-07 17:48:53,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 17:48:53,574 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 17:48:53,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 17:48:53,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 17:48:53,580 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 17:48:53,581 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 05:48:53" (1/1) ... [2022-04-07 17:48:53,582 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62769139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:48:53, skipping insertion in model container [2022-04-07 17:48:53,582 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 05:48:53" (1/1) ... [2022-04-07 17:48:53,588 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 17:48:53,599 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 17:48:53,809 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/sumt5.c[403,416] [2022-04-07 17:48:53,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 17:48:53,846 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 17:48:53,860 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/sumt5.c[403,416] [2022-04-07 17:48:53,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 17:48:53,887 INFO L208 MainTranslator]: Completed translation [2022-04-07 17:48:53,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:48:53 WrapperNode [2022-04-07 17:48:53,888 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 17:48:53,888 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 17:48:53,889 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 17:48:53,889 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 17:48:53,899 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:48:53" (1/1) ... [2022-04-07 17:48:53,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:48:53" (1/1) ... [2022-04-07 17:48:53,905 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:48:53" (1/1) ... [2022-04-07 17:48:53,906 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:48:53" (1/1) ... [2022-04-07 17:48:53,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:48:53" (1/1) ... [2022-04-07 17:48:53,926 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:48:53" (1/1) ... [2022-04-07 17:48:53,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:48:53" (1/1) ... [2022-04-07 17:48:53,936 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 17:48:53,937 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 17:48:53,937 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 17:48:53,937 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 17:48:53,938 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:48:53" (1/1) ... [2022-04-07 17:48:53,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 17:48:53,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:48:53,973 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-07 17:48:53,995 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-07 17:48:54,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 17:48:54,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 17:48:54,018 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 17:48:54,019 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 17:48:54,019 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 17:48:54,019 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 17:48:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 17:48:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 17:48:54,020 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 17:48:54,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 17:48:54,020 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 17:48:54,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 17:48:54,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 17:48:54,020 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 17:48:54,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 17:48:54,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 17:48:54,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 17:48:54,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 17:48:54,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 17:48:54,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 17:48:54,084 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 17:48:54,085 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 17:48:58,567 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 17:48:58,572 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 17:48:58,573 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 17:48:58,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:48:58 BoogieIcfgContainer [2022-04-07 17:48:58,574 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 17:48:58,579 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 17:48:58,580 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 17:48:58,581 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 17:48:58,583 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:48:58" (1/1) ... [2022-04-07 17:48:58,585 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 17:48:58,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 05:48:58 BasicIcfg [2022-04-07 17:48:58,609 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 17:48:58,610 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 17:48:58,610 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 17:48:58,615 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 17:48:58,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 05:48:53" (1/4) ... [2022-04-07 17:48:58,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5909f141 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 05:48:58, skipping insertion in model container [2022-04-07 17:48:58,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:48:53" (2/4) ... [2022-04-07 17:48:58,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5909f141 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 05:48:58, skipping insertion in model container [2022-04-07 17:48:58,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:48:58" (3/4) ... [2022-04-07 17:48:58,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5909f141 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 05:48:58, skipping insertion in model container [2022-04-07 17:48:58,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 05:48:58" (4/4) ... [2022-04-07 17:48:58,620 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt5.cJordan [2022-04-07 17:48:58,625 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 17:48:58,625 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 17:48:58,665 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 17:48:58,673 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-07 17:48:58,673 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 17:48:58,695 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 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-07 17:48:58,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 17:48:58,702 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:48:58,703 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:48:58,703 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:48:58,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:48:58,708 INFO L85 PathProgramCache]: Analyzing trace with hash -2113582840, now seen corresponding path program 1 times [2022-04-07 17:48:58,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:48:58,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638560533] [2022-04-07 17:48:58,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:48:58,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:48:58,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:48:58,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:48:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:48:58,937 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] 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] {28#true} is VALID [2022-04-07 17:48:58,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-07 17:48:58,938 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-07 17:48:58,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:48:58,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] 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] {28#true} is VALID [2022-04-07 17:48:58,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-07 17:48:58,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-07 17:48:58,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-07 17:48:58,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} [78] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (= v_main_~j~0_3 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {28#true} is VALID [2022-04-07 17:48:58,945 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} [81] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-07 17:48:58,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#true} [83] L21-2-->L21-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {29#false} is VALID [2022-04-07 17:48:58,947 INFO L272 TraceCheckUtils]: 8: Hoare triple {29#false} [86] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~l~0_15 4294967296) (mod (+ v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~l~0=v_main_~l~0_15, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {29#false} is VALID [2022-04-07 17:48:58,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#false} [90] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {29#false} is VALID [2022-04-07 17:48:58,947 INFO L290 TraceCheckUtils]: 10: Hoare triple {29#false} [94] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {29#false} is VALID [2022-04-07 17:48:58,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} [98] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#false} is VALID [2022-04-07 17:48:58,948 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-07 17:48:58,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:48:58,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638560533] [2022-04-07 17:48:58,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638560533] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:48:58,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:48:58,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 17:48:58,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965608267] [2022-04-07 17:48:58,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:48:58,956 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-07 17:48:58,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:48:58,961 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-07 17:48:58,986 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-07 17:48:58,987 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 17:48:58,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:48:59,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 17:48:59,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 17:48:59,014 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 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-07 17:49:03,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:49:03,436 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-04-07 17:49:03,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 17:49:03,436 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-07 17:49:03,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:49:03,437 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-07 17:49:03,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-07 17:49:03,445 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-07 17:49:03,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-07 17:49:03,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-04-07 17:49:03,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:49:03,505 INFO L225 Difference]: With dead ends: 25 [2022-04-07 17:49:03,505 INFO L226 Difference]: Without dead ends: 18 [2022-04-07 17:49:03,507 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-07 17:49:03,509 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 30 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-07 17:49:03,510 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 30 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 17:49:03,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-07 17:49:03,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-07 17:49:03,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:49:03,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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-07 17:49:03,532 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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-07 17:49:03,532 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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-07 17:49:03,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:49:03,535 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2022-04-07 17:49:03,536 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-04-07 17:49:03,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:49:03,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:49:03,537 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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 18 states. [2022-04-07 17:49:03,537 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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 18 states. [2022-04-07 17:49:03,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:49:03,540 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2022-04-07 17:49:03,540 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-04-07 17:49:03,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:49:03,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:49:03,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:49:03,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:49:03,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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-07 17:49:03,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-04-07 17:49:03,544 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 12 [2022-04-07 17:49:03,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:49:03,544 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-04-07 17:49:03,545 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-07 17:49:03,545 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-04-07 17:49:03,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 17:49:03,546 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:49:03,546 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:49:03,546 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 17:49:03,546 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:49:03,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:49:03,547 INFO L85 PathProgramCache]: Analyzing trace with hash -2112659319, now seen corresponding path program 1 times [2022-04-07 17:49:03,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:49:03,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475350371] [2022-04-07 17:49:03,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:49:03,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:49:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:49:03,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:49:03,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:49:03,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {123#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] 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] {115#true} is VALID [2022-04-07 17:49:03,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {115#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {115#true} is VALID [2022-04-07 17:49:03,944 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {115#true} {115#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {115#true} is VALID [2022-04-07 17:49:03,945 INFO L272 TraceCheckUtils]: 0: Hoare triple {115#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:49:03,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {123#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] 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] {115#true} is VALID [2022-04-07 17:49:03,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {115#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {115#true} is VALID [2022-04-07 17:49:03,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115#true} {115#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {115#true} is VALID [2022-04-07 17:49:03,946 INFO L272 TraceCheckUtils]: 4: Hoare triple {115#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {115#true} is VALID [2022-04-07 17:49:03,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {115#true} [78] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (= v_main_~j~0_3 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {120#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:49:03,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {120#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [81] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {120#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:49:03,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {120#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [84] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {120#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:49:03,950 INFO L272 TraceCheckUtils]: 8: Hoare triple {120#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [86] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~l~0_15 4294967296) (mod (+ v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~l~0=v_main_~l~0_15, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {121#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 17:49:03,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {121#(not (= |__VERIFIER_assert_#in~cond| 0))} [90] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {122#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 17:49:03,951 INFO L290 TraceCheckUtils]: 10: Hoare triple {122#(not (= __VERIFIER_assert_~cond 0))} [94] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {116#false} is VALID [2022-04-07 17:49:03,951 INFO L290 TraceCheckUtils]: 11: Hoare triple {116#false} [98] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {116#false} is VALID [2022-04-07 17:49:03,952 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-07 17:49:03,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:49:03,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475350371] [2022-04-07 17:49:03,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475350371] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:49:03,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:49:03,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 17:49:03,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035611555] [2022-04-07 17:49:03,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:49:03,954 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-07 17:49:03,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:49:03,954 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-07 17:49:03,967 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-07 17:49:03,968 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:49:03,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:49:03,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:49:03,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 17:49:03,970 INFO L87 Difference]: Start difference. First operand 18 states and 22 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-07 17:49:06,131 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-07 17:49:10,535 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:49:14,838 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-07 17:49:15,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:49:15,051 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-07 17:49:15,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 17:49:15,051 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-07 17:49:15,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:49:15,052 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-07 17:49:15,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2022-04-07 17:49:15,054 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-07 17:49:15,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2022-04-07 17:49:15,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 29 transitions. [2022-04-07 17:49:15,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:49:15,094 INFO L225 Difference]: With dead ends: 23 [2022-04-07 17:49:15,094 INFO L226 Difference]: Without dead ends: 20 [2022-04-07 17:49:15,095 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 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-07 17:49:15,096 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-04-07 17:49:15,096 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 37 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 46 Invalid, 3 Unknown, 0 Unchecked, 6.6s Time] [2022-04-07 17:49:15,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-07 17:49:15,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-04-07 17:49:15,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:49:15,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 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-07 17:49:15,100 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 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-07 17:49:15,100 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 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-07 17:49:15,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:49:15,102 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2022-04-07 17:49:15,102 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-04-07 17:49:15,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:49:15,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:49:15,103 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 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-07 17:49:15,103 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 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-07 17:49:15,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:49:15,105 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2022-04-07 17:49:15,105 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-04-07 17:49:15,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:49:15,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:49:15,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:49:15,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:49:15,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 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-07 17:49:15,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-04-07 17:49:15,108 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2022-04-07 17:49:15,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:49:15,108 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-04-07 17:49:15,108 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-07 17:49:15,109 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-04-07 17:49:15,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-07 17:49:15,109 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:49:15,109 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:49:15,109 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 17:49:15,110 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:49:15,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:49:15,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1428544074, now seen corresponding path program 1 times [2022-04-07 17:49:15,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:49:15,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767405426] [2022-04-07 17:49:15,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:49:15,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:49:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:49:15,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:49:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:49:15,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {226#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] 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] {214#true} is VALID [2022-04-07 17:49:15,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {214#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {214#true} is VALID [2022-04-07 17:49:15,786 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {214#true} {214#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {214#true} is VALID [2022-04-07 17:49:15,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {214#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {226#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:49:15,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {226#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] 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] {214#true} is VALID [2022-04-07 17:49:15,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {214#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {214#true} is VALID [2022-04-07 17:49:15,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {214#true} {214#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {214#true} is VALID [2022-04-07 17:49:15,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {214#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {214#true} is VALID [2022-04-07 17:49:15,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {214#true} [78] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (= v_main_~j~0_3 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {219#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:49:15,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {219#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [81] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {219#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:49:15,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {219#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {220#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0) (= main_~v3~0 0))} is VALID [2022-04-07 17:49:15,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {220#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0) (= main_~v3~0 0))} [87] L23-->L29-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_12 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {221#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~v3~0)) (= main_~k~0 0) (<= main_~v3~0 1) (= main_~j~0 0) (<= 1 main_~v3~0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 17:49:15,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {221#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~v3~0)) (= main_~k~0 0) (<= main_~v3~0 1) (= main_~j~0 0) (<= 1 main_~v3~0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {222#(and (= main_~k~0 0) (< (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0 1)) (= main_~j~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))) (= main_~i~0 0) (= main_~v4~0 0) (or (and (<= main_~v3~0 main_~l~0) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v3~0))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0))))} is VALID [2022-04-07 17:49:15,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {222#(and (= main_~k~0 0) (< (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0 1)) (= main_~j~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))) (= main_~i~0 0) (= main_~v4~0 0) (or (and (<= main_~v3~0 main_~l~0) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v3~0))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0))))} [84] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {223#(and (= main_~k~0 0) (< (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0 1)) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~v3~0 (+ 4294967295 (* (div main_~l~0 4294967296) 4294967296))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0)))} is VALID [2022-04-07 17:49:15,800 INFO L272 TraceCheckUtils]: 11: Hoare triple {223#(and (= main_~k~0 0) (< (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0 1)) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~v3~0 (+ 4294967295 (* (div main_~l~0 4294967296) 4294967296))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0)))} [86] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~l~0_15 4294967296) (mod (+ v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~l~0=v_main_~l~0_15, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {224#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 17:49:15,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {224#(not (= |__VERIFIER_assert_#in~cond| 0))} [90] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {225#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 17:49:15,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {225#(not (= __VERIFIER_assert_~cond 0))} [94] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {215#false} is VALID [2022-04-07 17:49:15,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {215#false} [98] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#false} is VALID [2022-04-07 17:49:15,803 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-07 17:49:15,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:49:15,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767405426] [2022-04-07 17:49:15,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767405426] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:49:15,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049806326] [2022-04-07 17:49:15,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:49:15,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:49:15,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:49:15,816 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-07 17:49:15,823 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-07 17:49:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:49:15,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-07 17:49:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:49:15,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:49:16,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {214#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {214#true} is VALID [2022-04-07 17:49:16,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {214#true} [76] 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] {214#true} is VALID [2022-04-07 17:49:16,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {214#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {214#true} is VALID [2022-04-07 17:49:16,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {214#true} {214#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {214#true} is VALID [2022-04-07 17:49:16,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {214#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {214#true} is VALID [2022-04-07 17:49:16,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {214#true} [78] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (= v_main_~j~0_3 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {219#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:49:16,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {219#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [81] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {219#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:49:16,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {219#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {219#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:49:16,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {219#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [87] L23-->L29-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_12 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {254#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:49:16,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {254#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {258#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:49:16,251 INFO L290 TraceCheckUtils]: 10: Hoare triple {258#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [84] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {258#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:49:16,252 INFO L272 TraceCheckUtils]: 11: Hoare triple {258#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [86] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~l~0_15 4294967296) (mod (+ v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~l~0=v_main_~l~0_15, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {265#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:49:16,253 INFO L290 TraceCheckUtils]: 12: Hoare triple {265#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {269#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:49:16,253 INFO L290 TraceCheckUtils]: 13: Hoare triple {269#(<= 1 __VERIFIER_assert_~cond)} [94] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {215#false} is VALID [2022-04-07 17:49:16,254 INFO L290 TraceCheckUtils]: 14: Hoare triple {215#false} [98] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#false} is VALID [2022-04-07 17:49:16,254 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-07 17:49:16,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:49:16,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {215#false} [98] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#false} is VALID [2022-04-07 17:49:16,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {269#(<= 1 __VERIFIER_assert_~cond)} [94] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {215#false} is VALID [2022-04-07 17:49:16,775 INFO L290 TraceCheckUtils]: 12: Hoare triple {265#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {269#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:49:16,777 INFO L272 TraceCheckUtils]: 11: Hoare triple {285#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [86] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~l~0_15 4294967296) (mod (+ v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~l~0=v_main_~l~0_15, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {265#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:49:16,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {285#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [84] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {285#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:49:16,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {292#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {285#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:49:18,887 WARN L290 TraceCheckUtils]: 8: Hoare triple {285#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [87] L23-->L29-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_12 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {292#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-07 17:49:18,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {285#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {285#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:49:18,888 INFO L290 TraceCheckUtils]: 6: Hoare triple {285#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [81] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {285#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:49:18,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {214#true} [78] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (= v_main_~j~0_3 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {285#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:49:18,890 INFO L272 TraceCheckUtils]: 4: Hoare triple {214#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {214#true} is VALID [2022-04-07 17:49:18,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {214#true} {214#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {214#true} is VALID [2022-04-07 17:49:18,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {214#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {214#true} is VALID [2022-04-07 17:49:18,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {214#true} [76] 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] {214#true} is VALID [2022-04-07 17:49:18,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {214#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {214#true} is VALID [2022-04-07 17:49:18,891 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-07 17:49:18,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049806326] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 17:49:18,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 17:49:18,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 7] total 16 [2022-04-07 17:49:18,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130609428] [2022-04-07 17:49:18,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:49:18,896 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-07 17:49:18,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:49:18,897 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-07 17:49:21,036 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-07 17:49:21,036 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:49:21,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:49:21,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:49:21,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-07 17:49:21,037 INFO L87 Difference]: Start difference. First operand 19 states and 23 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-07 17:49:23,118 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-07 17:49:29,634 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-07 17:49:33,936 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-07 17:49:36,145 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-07 17:49:36,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:49:36,263 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-04-07 17:49:36,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 17:49:36,264 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-07 17:49:36,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:49:36,264 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-07 17:49:36,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-04-07 17:49:36,266 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-07 17:49:36,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-04-07 17:49:36,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 30 transitions. [2022-04-07 17:49:38,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 29 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 17:49:38,411 INFO L225 Difference]: With dead ends: 25 [2022-04-07 17:49:38,411 INFO L226 Difference]: Without dead ends: 22 [2022-04-07 17:49:38,412 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-04-07 17:49:38,412 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-04-07 17:49:38,413 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 4 Unknown, 0 Unchecked, 8.3s Time] [2022-04-07 17:49:38,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-07 17:49:38,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-07 17:49:38,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:49:38,415 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:49:38,416 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:49:38,416 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:49:38,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:49:38,417 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-07 17:49:38,418 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-07 17:49:38,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:49:38,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:49:38,418 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-07 17:49:38,418 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-07 17:49:38,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:49:38,419 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-07 17:49:38,419 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-07 17:49:38,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:49:38,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:49:38,420 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:49:38,420 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:49:38,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:49:38,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-04-07 17:49:38,422 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 15 [2022-04-07 17:49:38,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:49:38,422 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-04-07 17:49:38,422 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-07 17:49:38,422 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-04-07 17:49:38,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-07 17:49:38,423 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:49:38,423 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:49:38,443 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-07 17:49:38,635 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-07 17:49:38,636 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:49:38,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:49:38,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1493554663, now seen corresponding path program 1 times [2022-04-07 17:49:38,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:49:38,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670093441] [2022-04-07 17:49:38,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:49:38,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:49:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:49:38,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:49:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:49:38,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {422#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] 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] {423#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 17:49:38,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {423#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {423#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 17:49:38,912 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {423#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {414#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {419#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:49:38,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {414#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {422#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:49:38,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {422#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] 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] {423#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 17:49:38,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {423#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {423#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 17:49:38,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {423#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {414#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {419#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:49:38,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {419#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {419#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:49:38,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {419#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [78] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (= v_main_~j~0_3 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {420#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:49:38,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {420#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [81] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {421#(= main_~l~0 0)} is VALID [2022-04-07 17:49:38,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {421#(= main_~l~0 0)} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {421#(= main_~l~0 0)} is VALID [2022-04-07 17:49:38,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {421#(= main_~l~0 0)} [88] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_13 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_13} OutVars{main_~l~0=v_main_~l~0_13} AuxVars[] AssignedVars[] {415#false} is VALID [2022-04-07 17:49:38,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {415#false} [92] L25-->L29-2: Formula: (and (= (mod v_main_~l~0_14 4) 0) (= v_main_~v4~0_3 (+ v_main_~v4~0_4 1))) InVars {main_~l~0=v_main_~l~0_14, main_~v4~0=v_main_~v4~0_4} OutVars{main_~l~0=v_main_~l~0_14, main_~v4~0=v_main_~v4~0_3} AuxVars[] AssignedVars[main_~v4~0] {415#false} is VALID [2022-04-07 17:49:38,919 INFO L290 TraceCheckUtils]: 10: Hoare triple {415#false} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {415#false} is VALID [2022-04-07 17:49:38,919 INFO L290 TraceCheckUtils]: 11: Hoare triple {415#false} [84] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {415#false} is VALID [2022-04-07 17:49:38,920 INFO L272 TraceCheckUtils]: 12: Hoare triple {415#false} [86] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~l~0_15 4294967296) (mod (+ v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~l~0=v_main_~l~0_15, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {415#false} is VALID [2022-04-07 17:49:38,920 INFO L290 TraceCheckUtils]: 13: Hoare triple {415#false} [90] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {415#false} is VALID [2022-04-07 17:49:38,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {415#false} [94] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {415#false} is VALID [2022-04-07 17:49:38,920 INFO L290 TraceCheckUtils]: 15: Hoare triple {415#false} [98] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {415#false} is VALID [2022-04-07 17:49:38,920 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-07 17:49:38,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:49:38,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670093441] [2022-04-07 17:49:38,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670093441] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:49:38,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:49:38,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 17:49:38,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407025684] [2022-04-07 17:49:38,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:49:38,922 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-07 17:49:38,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:49:38,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:49:41,103 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-07 17:49:41,103 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 17:49:41,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:49:41,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 17:49:41,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-07 17:49:41,104 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:49:45,422 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-07 17:49:47,574 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:49:54,028 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-07 17:49:56,180 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:49:56,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:49:56,397 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-04-07 17:49:56,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 17:49:56,397 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-07 17:49:56,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:49:56,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:49:56,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-07 17:49:56,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:49:56,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-07 17:49:56,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2022-04-07 17:49:58,589 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-07 17:49:58,590 INFO L225 Difference]: With dead ends: 24 [2022-04-07 17:49:58,590 INFO L226 Difference]: Without dead ends: 24 [2022-04-07 17:49:58,591 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-07 17:49:58,591 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 42 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 7 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-04-07 17:49:58,592 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 28 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 35 Invalid, 4 Unknown, 0 Unchecked, 8.4s Time] [2022-04-07 17:49:58,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-07 17:49:58,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-04-07 17:49:58,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:49:58,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-07 17:49:58,594 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-07 17:49:58,595 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-07 17:49:58,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:49:58,596 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-04-07 17:49:58,596 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-04-07 17:49:58,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:49:58,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:49:58,597 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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 24 states. [2022-04-07 17:49:58,597 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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 24 states. [2022-04-07 17:49:58,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:49:58,599 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-04-07 17:49:58,599 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-04-07 17:49:58,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:49:58,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:49:58,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:49:58,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:49:58,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-07 17:49:58,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-04-07 17:49:58,601 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 16 [2022-04-07 17:49:58,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:49:58,601 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-04-07 17:49:58,601 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:49:58,601 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-07 17:49:58,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-07 17:49:58,602 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:49:58,602 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:49:58,602 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 17:49:58,602 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:49:58,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:49:58,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1990443884, now seen corresponding path program 1 times [2022-04-07 17:49:58,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:49:58,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376800282] [2022-04-07 17:49:58,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:49:58,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:49:58,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:49:58,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:49:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:49:58,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {532#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] 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] {525#true} is VALID [2022-04-07 17:49:58,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {525#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {525#true} is VALID [2022-04-07 17:49:58,684 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {525#true} {525#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {525#true} is VALID [2022-04-07 17:49:58,685 INFO L272 TraceCheckUtils]: 0: Hoare triple {525#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {532#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:49:58,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {532#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] 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] {525#true} is VALID [2022-04-07 17:49:58,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {525#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {525#true} is VALID [2022-04-07 17:49:58,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {525#true} {525#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {525#true} is VALID [2022-04-07 17:49:58,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {525#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {525#true} is VALID [2022-04-07 17:49:58,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {525#true} [78] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (= v_main_~j~0_3 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {530#(= main_~l~0 0)} is VALID [2022-04-07 17:49:58,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {530#(= main_~l~0 0)} [81] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {530#(= main_~l~0 0)} is VALID [2022-04-07 17:49:58,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {530#(= main_~l~0 0)} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {530#(= main_~l~0 0)} is VALID [2022-04-07 17:49:58,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {530#(= main_~l~0 0)} [87] L23-->L29-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_12 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {530#(= main_~l~0 0)} is VALID [2022-04-07 17:49:58,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {530#(= main_~l~0 0)} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {531#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 17:49:58,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {531#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {531#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 17:49:58,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {531#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} [88] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_13 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_13} OutVars{main_~l~0=v_main_~l~0_13} AuxVars[] AssignedVars[] {531#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 17:49:58,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {531#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} [92] L25-->L29-2: Formula: (and (= (mod v_main_~l~0_14 4) 0) (= v_main_~v4~0_3 (+ v_main_~v4~0_4 1))) InVars {main_~l~0=v_main_~l~0_14, main_~v4~0=v_main_~v4~0_4} OutVars{main_~l~0=v_main_~l~0_14, main_~v4~0=v_main_~v4~0_3} AuxVars[] AssignedVars[main_~v4~0] {526#false} is VALID [2022-04-07 17:49:58,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {526#false} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {526#false} is VALID [2022-04-07 17:49:58,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {526#false} [84] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {526#false} is VALID [2022-04-07 17:49:58,691 INFO L272 TraceCheckUtils]: 15: Hoare triple {526#false} [86] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~l~0_15 4294967296) (mod (+ v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~l~0=v_main_~l~0_15, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {526#false} is VALID [2022-04-07 17:49:58,691 INFO L290 TraceCheckUtils]: 16: Hoare triple {526#false} [90] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {526#false} is VALID [2022-04-07 17:49:58,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {526#false} [94] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {526#false} is VALID [2022-04-07 17:49:58,692 INFO L290 TraceCheckUtils]: 18: Hoare triple {526#false} [98] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#false} is VALID [2022-04-07 17:49:58,692 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-07 17:49:58,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:49:58,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376800282] [2022-04-07 17:49:58,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376800282] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:49:58,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131519501] [2022-04-07 17:49:58,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:49:58,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:49:58,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:49:58,696 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-07 17:49:58,700 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-07 17:49:58,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:49:58,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-07 17:49:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:49:58,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:49:59,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {525#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {525#true} is VALID [2022-04-07 17:49:59,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {525#true} [76] 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] {525#true} is VALID [2022-04-07 17:49:59,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {525#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {525#true} is VALID [2022-04-07 17:49:59,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {525#true} {525#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {525#true} is VALID [2022-04-07 17:49:59,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {525#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {525#true} is VALID [2022-04-07 17:49:59,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {525#true} [78] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (= v_main_~j~0_3 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {551#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:49:59,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {551#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [81] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {551#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:49:59,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {551#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {551#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:49:59,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {551#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [87] L23-->L29-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_12 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {561#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:49:59,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {561#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {565#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:49:59,167 INFO L290 TraceCheckUtils]: 10: Hoare triple {565#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {565#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:49:59,168 INFO L290 TraceCheckUtils]: 11: Hoare triple {565#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [88] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_13 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_13} OutVars{main_~l~0=v_main_~l~0_13} AuxVars[] AssignedVars[] {565#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:49:59,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {565#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [92] L25-->L29-2: Formula: (and (= (mod v_main_~l~0_14 4) 0) (= v_main_~v4~0_3 (+ v_main_~v4~0_4 1))) InVars {main_~l~0=v_main_~l~0_14, main_~v4~0=v_main_~v4~0_4} OutVars{main_~l~0=v_main_~l~0_14, main_~v4~0=v_main_~v4~0_3} AuxVars[] AssignedVars[main_~v4~0] {575#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:49:59,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {575#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 1))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {579#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:49:59,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {579#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 1))} [84] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {579#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:49:59,171 INFO L272 TraceCheckUtils]: 15: Hoare triple {579#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 1))} [86] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~l~0_15 4294967296) (mod (+ v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~l~0=v_main_~l~0_15, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {586#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:49:59,171 INFO L290 TraceCheckUtils]: 16: Hoare triple {586#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {590#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:49:59,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {590#(<= 1 __VERIFIER_assert_~cond)} [94] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {526#false} is VALID [2022-04-07 17:49:59,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {526#false} [98] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#false} is VALID [2022-04-07 17:49:59,172 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-07 17:49:59,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:49:59,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {526#false} [98] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#false} is VALID [2022-04-07 17:49:59,435 INFO L290 TraceCheckUtils]: 17: Hoare triple {590#(<= 1 __VERIFIER_assert_~cond)} [94] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {526#false} is VALID [2022-04-07 17:49:59,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {586#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {590#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:49:59,437 INFO L272 TraceCheckUtils]: 15: Hoare triple {606#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [86] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~l~0_15 4294967296) (mod (+ v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~l~0=v_main_~l~0_15, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {586#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:49:59,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {606#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [84] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {606#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:49:59,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {613#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {606#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:49:59,483 INFO L290 TraceCheckUtils]: 12: Hoare triple {606#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [92] L25-->L29-2: Formula: (and (= (mod v_main_~l~0_14 4) 0) (= v_main_~v4~0_3 (+ v_main_~v4~0_4 1))) InVars {main_~l~0=v_main_~l~0_14, main_~v4~0=v_main_~v4~0_4} OutVars{main_~l~0=v_main_~l~0_14, main_~v4~0=v_main_~v4~0_3} AuxVars[] AssignedVars[main_~v4~0] {613#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:49:59,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {606#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [88] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_13 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_13} OutVars{main_~l~0=v_main_~l~0_13} AuxVars[] AssignedVars[] {606#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:49:59,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {606#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {606#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:49:59,487 INFO L290 TraceCheckUtils]: 9: Hoare triple {613#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {606#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:01,594 WARN L290 TraceCheckUtils]: 8: Hoare triple {606#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [87] L23-->L29-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_12 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {613#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-07 17:50:01,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {606#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {606#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:01,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {606#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [81] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {606#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:01,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {525#true} [78] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (= v_main_~j~0_3 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {606#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:01,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {525#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {525#true} is VALID [2022-04-07 17:50:01,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {525#true} {525#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {525#true} is VALID [2022-04-07 17:50:01,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {525#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {525#true} is VALID [2022-04-07 17:50:01,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {525#true} [76] 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] {525#true} is VALID [2022-04-07 17:50:01,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {525#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {525#true} is VALID [2022-04-07 17:50:01,596 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-07 17:50:01,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131519501] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 17:50:01,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 17:50:01,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-07 17:50:01,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698032250] [2022-04-07 17:50:01,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:50:01,597 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-07 17:50:01,597 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:50:01,598 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-07 17:50:03,768 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-07 17:50:03,768 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:50:03,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:50:03,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:50:03,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-07 17:50:03,769 INFO L87 Difference]: Start difference. First operand 23 states and 28 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-07 17:50:05,824 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-07 17:50:08,017 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-07 17:50:10,128 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:50:12,236 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:50:14,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:50:14,599 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-04-07 17:50:14,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 17:50:14,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-07 17:50:14,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:50:14,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-07 17:50:14,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-04-07 17:50:14,602 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-07 17:50:14,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-04-07 17:50:14,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 34 transitions. [2022-04-07 17:50:16,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 33 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 17:50:16,809 INFO L225 Difference]: With dead ends: 31 [2022-04-07 17:50:16,809 INFO L226 Difference]: Without dead ends: 28 [2022-04-07 17:50:16,810 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-07 17:50:16,811 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-04-07 17:50:16,811 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 48 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 4 Unknown, 0 Unchecked, 8.6s Time] [2022-04-07 17:50:16,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-07 17:50:16,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-04-07 17:50:16,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:50:16,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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-07 17:50:16,814 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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-07 17:50:16,814 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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-07 17:50:16,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:50:16,815 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-07 17:50:16,815 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-04-07 17:50:16,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:50:16,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:50:16,816 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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 28 states. [2022-04-07 17:50:16,816 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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 28 states. [2022-04-07 17:50:16,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:50:16,817 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-07 17:50:16,817 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-04-07 17:50:16,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:50:16,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:50:16,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:50:16,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:50:16,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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-07 17:50:16,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2022-04-07 17:50:16,819 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 19 [2022-04-07 17:50:16,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:50:16,819 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2022-04-07 17:50:16,820 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-07 17:50:16,820 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-04-07 17:50:16,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-07 17:50:16,820 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:50:16,820 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:50:16,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-07 17:50:17,031 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-07 17:50:17,032 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:50:17,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:50:17,032 INFO L85 PathProgramCache]: Analyzing trace with hash 509577165, now seen corresponding path program 1 times [2022-04-07 17:50:17,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:50:17,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683480508] [2022-04-07 17:50:17,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:50:17,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:50:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:50:17,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:50:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:50:17,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {780#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] 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] {781#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 17:50:17,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {781#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {781#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 17:50:17,441 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {781#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {768#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {773#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:50:17,442 INFO L272 TraceCheckUtils]: 0: Hoare triple {768#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {780#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:50:17,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {780#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] 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] {781#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 17:50:17,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {781#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {781#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 17:50:17,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {781#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {768#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {773#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:50:17,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {773#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {773#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:50:17,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {773#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [78] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (= v_main_~j~0_3 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {774#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:50:17,446 INFO L290 TraceCheckUtils]: 6: Hoare triple {774#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [81] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {775#(= main_~l~0 0)} is VALID [2022-04-07 17:50:17,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {775#(= main_~l~0 0)} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {775#(= main_~l~0 0)} is VALID [2022-04-07 17:50:17,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {775#(= main_~l~0 0)} [87] L23-->L29-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_12 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {775#(= main_~l~0 0)} is VALID [2022-04-07 17:50:17,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {775#(= main_~l~0 0)} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {776#(<= (+ (* (div (+ (* (- 1) main_~l~0) (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) (* (div main_~l~0 4294967296) 4294967298)) 2) 4294967296) 1) main_~l~0)} is VALID [2022-04-07 17:50:17,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {776#(<= (+ (* (div (+ (* (- 1) main_~l~0) (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) (* (div main_~l~0 4294967296) 4294967298)) 2) 4294967296) 1) main_~l~0)} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {777#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-07 17:50:17,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {777#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [88] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_13 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_13} OutVars{main_~l~0=v_main_~l~0_13} AuxVars[] AssignedVars[] {777#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-07 17:50:17,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {777#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [93] L25-->L27: Formula: (not (= (mod v_main_~l~0_1 4) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {777#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-07 17:50:17,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {777#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [96] L27-->L29-2: Formula: (and (= (mod (mod (mod v_main_~l~0_2 4294967296) 3) 4294967296) 0) (= v_main_~i~0_1 (+ v_main_~i~0_2 1))) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_2} AuxVars[] AssignedVars[main_~i~0] {778#(<= (+ (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-07 17:50:17,473 INFO L290 TraceCheckUtils]: 14: Hoare triple {778#(<= (+ (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {779#(<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 2147483648) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296)))} is VALID [2022-04-07 17:50:17,474 INFO L290 TraceCheckUtils]: 15: Hoare triple {779#(<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 2147483648) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296)))} [84] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {769#false} is VALID [2022-04-07 17:50:17,474 INFO L272 TraceCheckUtils]: 16: Hoare triple {769#false} [86] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~l~0_15 4294967296) (mod (+ v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~l~0=v_main_~l~0_15, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {769#false} is VALID [2022-04-07 17:50:17,474 INFO L290 TraceCheckUtils]: 17: Hoare triple {769#false} [90] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {769#false} is VALID [2022-04-07 17:50:17,474 INFO L290 TraceCheckUtils]: 18: Hoare triple {769#false} [94] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {769#false} is VALID [2022-04-07 17:50:17,475 INFO L290 TraceCheckUtils]: 19: Hoare triple {769#false} [98] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {769#false} is VALID [2022-04-07 17:50:17,475 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-07 17:50:17,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:50:17,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683480508] [2022-04-07 17:50:17,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683480508] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:50:17,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738295897] [2022-04-07 17:50:17,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:50:17,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:50:17,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:50:17,480 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 17:50:17,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-07 17:50:17,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:50:17,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-07 17:50:17,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:50:17,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:50:18,009 INFO L272 TraceCheckUtils]: 0: Hoare triple {768#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {768#true} is VALID [2022-04-07 17:50:18,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {768#true} [76] 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] {768#true} is VALID [2022-04-07 17:50:18,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {768#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {768#true} is VALID [2022-04-07 17:50:18,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {768#true} {768#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {768#true} is VALID [2022-04-07 17:50:18,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {768#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {768#true} is VALID [2022-04-07 17:50:18,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {768#true} [78] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (= v_main_~j~0_3 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {800#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:50:18,016 INFO L290 TraceCheckUtils]: 6: Hoare triple {800#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [81] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {800#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:50:18,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {800#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {800#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:50:18,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {800#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [87] L23-->L29-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_12 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {810#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 17:50:18,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {810#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {814#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 17:50:18,019 INFO L290 TraceCheckUtils]: 10: Hoare triple {814#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {814#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 17:50:18,019 INFO L290 TraceCheckUtils]: 11: Hoare triple {814#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} [88] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_13 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_13} OutVars{main_~l~0=v_main_~l~0_13} AuxVars[] AssignedVars[] {814#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 17:50:18,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {814#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} [93] L25-->L27: Formula: (not (= (mod v_main_~l~0_1 4) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {814#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 17:50:18,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {814#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} [96] L27-->L29-2: Formula: (and (= (mod (mod (mod v_main_~l~0_2 4294967296) 3) 4294967296) 0) (= v_main_~i~0_1 (+ v_main_~i~0_2 1))) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_2} AuxVars[] AssignedVars[main_~i~0] {827#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 1) (= main_~v4~0 0))} is VALID [2022-04-07 17:50:18,021 INFO L290 TraceCheckUtils]: 14: Hoare triple {827#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 1) (= main_~v4~0 0))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {831#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 0))} is VALID [2022-04-07 17:50:18,022 INFO L290 TraceCheckUtils]: 15: Hoare triple {831#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 0))} [84] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {831#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 0))} is VALID [2022-04-07 17:50:18,023 INFO L272 TraceCheckUtils]: 16: Hoare triple {831#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 0))} [86] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~l~0_15 4294967296) (mod (+ v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~l~0=v_main_~l~0_15, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {838#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:50:18,023 INFO L290 TraceCheckUtils]: 17: Hoare triple {838#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {842#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:50:18,024 INFO L290 TraceCheckUtils]: 18: Hoare triple {842#(<= 1 __VERIFIER_assert_~cond)} [94] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {769#false} is VALID [2022-04-07 17:50:18,024 INFO L290 TraceCheckUtils]: 19: Hoare triple {769#false} [98] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {769#false} is VALID [2022-04-07 17:50:18,024 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-07 17:50:18,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:50:18,302 INFO L290 TraceCheckUtils]: 19: Hoare triple {769#false} [98] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {769#false} is VALID [2022-04-07 17:50:18,303 INFO L290 TraceCheckUtils]: 18: Hoare triple {842#(<= 1 __VERIFIER_assert_~cond)} [94] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {769#false} is VALID [2022-04-07 17:50:18,304 INFO L290 TraceCheckUtils]: 17: Hoare triple {838#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {842#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:50:18,305 INFO L272 TraceCheckUtils]: 16: Hoare triple {858#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [86] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~l~0_15 4294967296) (mod (+ v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~l~0=v_main_~l~0_15, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {838#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:50:18,305 INFO L290 TraceCheckUtils]: 15: Hoare triple {858#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [84] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {858#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:18,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {865#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {858#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:20,414 WARN L290 TraceCheckUtils]: 13: Hoare triple {858#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [96] L27-->L29-2: Formula: (and (= (mod (mod (mod v_main_~l~0_2 4294967296) 3) 4294967296) 0) (= v_main_~i~0_1 (+ v_main_~i~0_2 1))) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_2} AuxVars[] AssignedVars[main_~i~0] {865#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-07 17:50:20,415 INFO L290 TraceCheckUtils]: 12: Hoare triple {858#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [93] L25-->L27: Formula: (not (= (mod v_main_~l~0_1 4) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {858#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:20,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {858#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [88] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_13 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_13} OutVars{main_~l~0=v_main_~l~0_13} AuxVars[] AssignedVars[] {858#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:20,416 INFO L290 TraceCheckUtils]: 10: Hoare triple {858#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {858#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:20,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {865#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {858#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:20,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {858#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [87] L23-->L29-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_12 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {865#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:20,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {858#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {858#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:20,428 INFO L290 TraceCheckUtils]: 6: Hoare triple {858#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [81] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {858#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:20,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {768#true} [78] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (= v_main_~j~0_3 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {858#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:20,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {768#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {768#true} is VALID [2022-04-07 17:50:20,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {768#true} {768#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {768#true} is VALID [2022-04-07 17:50:20,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {768#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {768#true} is VALID [2022-04-07 17:50:20,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {768#true} [76] 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] {768#true} is VALID [2022-04-07 17:50:20,430 INFO L272 TraceCheckUtils]: 0: Hoare triple {768#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {768#true} is VALID [2022-04-07 17:50:20,430 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-07 17:50:20,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738295897] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 17:50:20,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 17:50:20,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 9] total 20 [2022-04-07 17:50:20,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899898108] [2022-04-07 17:50:20,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:50:20,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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 20 [2022-04-07 17:50:20,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:50:20,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-07 17:50:24,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 16 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 17:50:24,679 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:50:24,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:50:24,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:50:24,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-04-07 17:50:24,680 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-07 17:50:28,848 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-07 17:50:31,080 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-07 17:50:31,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:50:31,343 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-07 17:50:31,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 17:50:31,343 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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 20 [2022-04-07 17:50:31,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:50:31,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-07 17:50:31,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-04-07 17:50:31,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-07 17:50:31,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-04-07 17:50:31,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 34 transitions. [2022-04-07 17:50:35,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 32 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 17:50:35,623 INFO L225 Difference]: With dead ends: 32 [2022-04-07 17:50:35,624 INFO L226 Difference]: Without dead ends: 29 [2022-04-07 17:50:35,624 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-04-07 17:50:35,625 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-07 17:50:35,625 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-04-07 17:50:35,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-07 17:50:35,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-04-07 17:50:35,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:50:35,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 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-07 17:50:35,628 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 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-07 17:50:35,628 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 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-07 17:50:35,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:50:35,629 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-04-07 17:50:35,629 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-04-07 17:50:35,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:50:35,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:50:35,630 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 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 29 states. [2022-04-07 17:50:35,630 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 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 29 states. [2022-04-07 17:50:35,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:50:35,632 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-04-07 17:50:35,632 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-04-07 17:50:35,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:50:35,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:50:35,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:50:35,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:50:35,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 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-07 17:50:35,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-04-07 17:50:35,634 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 20 [2022-04-07 17:50:35,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:50:35,634 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-04-07 17:50:35,634 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-07 17:50:35,634 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-07 17:50:35,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 17:50:35,635 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:50:35,639 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:50:35,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-07 17:50:35,839 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:50:35,839 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:50:35,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:50:35,840 INFO L85 PathProgramCache]: Analyzing trace with hash 843369465, now seen corresponding path program 1 times [2022-04-07 17:50:35,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:50:35,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843048658] [2022-04-07 17:50:35,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:50:35,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:50:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:50:35,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:50:35,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:50:35,920 INFO L290 TraceCheckUtils]: 0: Hoare triple {1034#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] 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] {1027#true} is VALID [2022-04-07 17:50:35,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {1027#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1027#true} is VALID [2022-04-07 17:50:35,920 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1027#true} {1027#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1027#true} is VALID [2022-04-07 17:50:35,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {1027#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1034#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:50:35,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {1034#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] 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] {1027#true} is VALID [2022-04-07 17:50:35,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {1027#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1027#true} is VALID [2022-04-07 17:50:35,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1027#true} {1027#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1027#true} is VALID [2022-04-07 17:50:35,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {1027#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1027#true} is VALID [2022-04-07 17:50:35,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {1027#true} [78] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (= v_main_~j~0_3 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {1032#(= main_~l~0 0)} is VALID [2022-04-07 17:50:35,923 INFO L290 TraceCheckUtils]: 6: Hoare triple {1032#(= main_~l~0 0)} [81] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1032#(= main_~l~0 0)} is VALID [2022-04-07 17:50:35,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {1032#(= main_~l~0 0)} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1032#(= main_~l~0 0)} is VALID [2022-04-07 17:50:35,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {1032#(= main_~l~0 0)} [87] L23-->L29-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_12 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {1032#(= main_~l~0 0)} is VALID [2022-04-07 17:50:35,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {1032#(= main_~l~0 0)} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {1033#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 17:50:35,925 INFO L290 TraceCheckUtils]: 10: Hoare triple {1033#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1033#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 17:50:35,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {1033#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [88] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_13 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_13} OutVars{main_~l~0=v_main_~l~0_13} AuxVars[] AssignedVars[] {1033#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 17:50:35,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {1033#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [93] L25-->L27: Formula: (not (= (mod v_main_~l~0_1 4) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1033#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 17:50:35,927 INFO L290 TraceCheckUtils]: 13: Hoare triple {1033#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [97] L27-->L29: Formula: (not (= (mod (mod (mod v_main_~l~0_3 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {1033#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 17:50:35,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {1033#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [101] L29-->L29-2: Formula: (and (= (mod v_main_~l~0_4 2) 0) (= v_main_~j~0_1 (+ v_main_~j~0_2 1))) InVars {main_~l~0=v_main_~l~0_4, main_~j~0=v_main_~j~0_2} OutVars{main_~l~0=v_main_~l~0_4, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] {1028#false} is VALID [2022-04-07 17:50:35,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {1028#false} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {1028#false} is VALID [2022-04-07 17:50:35,928 INFO L290 TraceCheckUtils]: 16: Hoare triple {1028#false} [84] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1028#false} is VALID [2022-04-07 17:50:35,928 INFO L272 TraceCheckUtils]: 17: Hoare triple {1028#false} [86] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~l~0_15 4294967296) (mod (+ v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~l~0=v_main_~l~0_15, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {1028#false} is VALID [2022-04-07 17:50:35,928 INFO L290 TraceCheckUtils]: 18: Hoare triple {1028#false} [90] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1028#false} is VALID [2022-04-07 17:50:35,928 INFO L290 TraceCheckUtils]: 19: Hoare triple {1028#false} [94] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1028#false} is VALID [2022-04-07 17:50:35,929 INFO L290 TraceCheckUtils]: 20: Hoare triple {1028#false} [98] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1028#false} is VALID [2022-04-07 17:50:35,929 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-07 17:50:35,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:50:35,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843048658] [2022-04-07 17:50:35,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843048658] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:50:35,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175470236] [2022-04-07 17:50:35,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:50:35,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:50:35,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:50:35,930 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 17:50:35,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-07 17:50:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:50:35,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-07 17:50:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:50:35,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:50:36,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {1027#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1027#true} is VALID [2022-04-07 17:50:36,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {1027#true} [76] 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] {1027#true} is VALID [2022-04-07 17:50:36,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {1027#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1027#true} is VALID [2022-04-07 17:50:36,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1027#true} {1027#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1027#true} is VALID [2022-04-07 17:50:36,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {1027#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1027#true} is VALID [2022-04-07 17:50:36,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {1027#true} [78] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (= v_main_~j~0_3 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {1053#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:50:36,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {1053#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [81] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1053#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:50:36,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {1053#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1053#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:50:36,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {1053#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [87] L23-->L29-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_12 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {1063#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 17:50:36,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {1063#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {1067#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 17:50:36,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {1067#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1067#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 17:50:36,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {1067#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} [88] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_13 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_13} OutVars{main_~l~0=v_main_~l~0_13} AuxVars[] AssignedVars[] {1067#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 17:50:36,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {1067#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} [93] L25-->L27: Formula: (not (= (mod v_main_~l~0_1 4) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1067#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 17:50:36,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {1067#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} [97] L27-->L29: Formula: (not (= (mod (mod (mod v_main_~l~0_3 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {1067#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 17:50:36,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {1067#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} [101] L29-->L29-2: Formula: (and (= (mod v_main_~l~0_4 2) 0) (= v_main_~j~0_1 (+ v_main_~j~0_2 1))) InVars {main_~l~0=v_main_~l~0_4, main_~j~0=v_main_~j~0_2} OutVars{main_~l~0=v_main_~l~0_4, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] {1083#(and (= (+ (- 1) main_~v3~0) 0) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 17:50:36,509 INFO L290 TraceCheckUtils]: 15: Hoare triple {1083#(and (= (+ (- 1) main_~v3~0) 0) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {1087#(and (= (+ (- 1) main_~v3~0) 0) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1))} is VALID [2022-04-07 17:50:36,509 INFO L290 TraceCheckUtils]: 16: Hoare triple {1087#(and (= (+ (- 1) main_~v3~0) 0) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1))} [84] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1087#(and (= (+ (- 1) main_~v3~0) 0) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1))} is VALID [2022-04-07 17:50:36,510 INFO L272 TraceCheckUtils]: 17: Hoare triple {1087#(and (= (+ (- 1) main_~v3~0) 0) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1))} [86] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~l~0_15 4294967296) (mod (+ v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~l~0=v_main_~l~0_15, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {1094#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:50:36,511 INFO L290 TraceCheckUtils]: 18: Hoare triple {1094#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1098#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:50:36,511 INFO L290 TraceCheckUtils]: 19: Hoare triple {1098#(<= 1 __VERIFIER_assert_~cond)} [94] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1028#false} is VALID [2022-04-07 17:50:36,511 INFO L290 TraceCheckUtils]: 20: Hoare triple {1028#false} [98] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1028#false} is VALID [2022-04-07 17:50:36,511 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-07 17:50:36,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:50:36,729 INFO L290 TraceCheckUtils]: 20: Hoare triple {1028#false} [98] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1028#false} is VALID [2022-04-07 17:50:36,730 INFO L290 TraceCheckUtils]: 19: Hoare triple {1098#(<= 1 __VERIFIER_assert_~cond)} [94] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1028#false} is VALID [2022-04-07 17:50:36,731 INFO L290 TraceCheckUtils]: 18: Hoare triple {1094#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1098#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:50:36,735 INFO L272 TraceCheckUtils]: 17: Hoare triple {1114#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [86] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~l~0_15 4294967296) (mod (+ v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~l~0=v_main_~l~0_15, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {1094#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:50:36,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {1114#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [84] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1114#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:36,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {1121#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {1114#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:36,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {1114#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [101] L29-->L29-2: Formula: (and (= (mod v_main_~l~0_4 2) 0) (= v_main_~j~0_1 (+ v_main_~j~0_2 1))) InVars {main_~l~0=v_main_~l~0_4, main_~j~0=v_main_~j~0_2} OutVars{main_~l~0=v_main_~l~0_4, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] {1121#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:36,748 INFO L290 TraceCheckUtils]: 13: Hoare triple {1114#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [97] L27-->L29: Formula: (not (= (mod (mod (mod v_main_~l~0_3 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {1114#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:36,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {1114#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [93] L25-->L27: Formula: (not (= (mod v_main_~l~0_1 4) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1114#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:36,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {1114#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [88] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_13 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_13} OutVars{main_~l~0=v_main_~l~0_13} AuxVars[] AssignedVars[] {1114#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:36,749 INFO L290 TraceCheckUtils]: 10: Hoare triple {1114#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1114#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:36,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {1121#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {1114#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:38,855 WARN L290 TraceCheckUtils]: 8: Hoare triple {1114#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [87] L23-->L29-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_12 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {1121#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-07 17:50:38,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {1114#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1114#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:38,856 INFO L290 TraceCheckUtils]: 6: Hoare triple {1114#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [81] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1114#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:38,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {1027#true} [78] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (= v_main_~j~0_3 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {1114#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:38,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {1027#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1027#true} is VALID [2022-04-07 17:50:38,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1027#true} {1027#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1027#true} is VALID [2022-04-07 17:50:38,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {1027#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1027#true} is VALID [2022-04-07 17:50:38,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {1027#true} [76] 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] {1027#true} is VALID [2022-04-07 17:50:38,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {1027#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1027#true} is VALID [2022-04-07 17:50:38,858 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-07 17:50:38,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175470236] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 17:50:38,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 17:50:38,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-07 17:50:38,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618327429] [2022-04-07 17:50:38,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:50:38,859 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 21 [2022-04-07 17:50:38,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:50:38,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-07 17:50:40,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 18 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 17:50:40,986 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:50:40,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:50:40,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:50:40,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-07 17:50:40,987 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-07 17:50:43,065 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-07 17:50:45,348 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-07 17:50:47,462 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:50:47,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:50:47,724 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2022-04-07 17:50:47,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 17:50:47,724 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 21 [2022-04-07 17:50:47,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:50:47,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-07 17:50:47,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-07 17:50:47,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-07 17:50:47,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-07 17:50:47,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2022-04-07 17:50:49,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 35 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 17:50:49,911 INFO L225 Difference]: With dead ends: 39 [2022-04-07 17:50:49,911 INFO L226 Difference]: Without dead ends: 36 [2022-04-07 17:50:49,911 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-07 17:50:49,912 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-04-07 17:50:49,912 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 3 Unknown, 0 Unchecked, 6.6s Time] [2022-04-07 17:50:49,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-07 17:50:49,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-07 17:50:49,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:50:49,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 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-07 17:50:49,916 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 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-07 17:50:49,916 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 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-07 17:50:49,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:50:49,918 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2022-04-07 17:50:49,918 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2022-04-07 17:50:49,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:50:49,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:50:49,918 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 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 36 states. [2022-04-07 17:50:49,919 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 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 36 states. [2022-04-07 17:50:49,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:50:49,920 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2022-04-07 17:50:49,920 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2022-04-07 17:50:49,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:50:49,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:50:49,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:50:49,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:50:49,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 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-07 17:50:49,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2022-04-07 17:50:49,922 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 21 [2022-04-07 17:50:49,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:50:49,922 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2022-04-07 17:50:49,923 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-07 17:50:49,923 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2022-04-07 17:50:49,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-07 17:50:49,924 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:50:49,924 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:50:49,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-07 17:50:50,147 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:50:50,147 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:50:50,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:50:50,148 INFO L85 PathProgramCache]: Analyzing trace with hash 292028624, now seen corresponding path program 1 times [2022-04-07 17:50:50,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:50:50,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269702598] [2022-04-07 17:50:50,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:50:50,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:50:50,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:50:50,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:50:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:50:50,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {1331#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] 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] {1332#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 17:50:50,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {1332#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1332#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 17:50:50,609 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1332#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {1318#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1323#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:50:50,609 INFO L272 TraceCheckUtils]: 0: Hoare triple {1318#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1331#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:50:50,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {1331#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [76] 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] {1332#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 17:50:50,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {1332#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1332#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 17:50:50,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1332#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {1318#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1323#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:50:50,612 INFO L272 TraceCheckUtils]: 4: Hoare triple {1323#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1323#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:50:50,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {1323#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [78] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (= v_main_~j~0_3 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {1324#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:50:50,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {1324#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [81] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1325#(= main_~l~0 0)} is VALID [2022-04-07 17:50:50,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {1325#(= main_~l~0 0)} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1325#(= main_~l~0 0)} is VALID [2022-04-07 17:50:50,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {1325#(= main_~l~0 0)} [87] L23-->L29-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_12 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {1325#(= main_~l~0 0)} is VALID [2022-04-07 17:50:50,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {1325#(= main_~l~0 0)} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {1326#(<= (+ (* (div (+ (* (- 1) main_~l~0) (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) (* (div main_~l~0 4294967296) 4294967298)) 2) 4294967296) 1) main_~l~0)} is VALID [2022-04-07 17:50:50,617 INFO L290 TraceCheckUtils]: 10: Hoare triple {1326#(<= (+ (* (div (+ (* (- 1) main_~l~0) (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) (* (div main_~l~0 4294967296) 4294967298)) 2) 4294967296) 1) main_~l~0)} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1327#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-07 17:50:50,618 INFO L290 TraceCheckUtils]: 11: Hoare triple {1327#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [88] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_13 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_13} OutVars{main_~l~0=v_main_~l~0_13} AuxVars[] AssignedVars[] {1327#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-07 17:50:50,618 INFO L290 TraceCheckUtils]: 12: Hoare triple {1327#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [93] L25-->L27: Formula: (not (= (mod v_main_~l~0_1 4) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1327#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-07 17:50:52,726 WARN L290 TraceCheckUtils]: 13: Hoare triple {1327#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [96] L27-->L29-2: Formula: (and (= (mod (mod (mod v_main_~l~0_2 4294967296) 3) 4294967296) 0) (= v_main_~i~0_1 (+ v_main_~i~0_2 1))) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_2} AuxVars[] AssignedVars[main_~i~0] {1328#(<= (+ (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is UNKNOWN [2022-04-07 17:50:52,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {1328#(<= (+ (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {1329#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-07 17:50:52,741 INFO L290 TraceCheckUtils]: 15: Hoare triple {1329#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1329#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-07 17:50:52,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {1329#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} [88] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_13 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_13} OutVars{main_~l~0=v_main_~l~0_13} AuxVars[] AssignedVars[] {1329#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-07 17:50:52,742 INFO L290 TraceCheckUtils]: 17: Hoare triple {1329#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} [93] L25-->L27: Formula: (not (= (mod v_main_~l~0_1 4) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1329#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-07 17:50:52,743 INFO L290 TraceCheckUtils]: 18: Hoare triple {1329#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} [97] L27-->L29: Formula: (not (= (mod (mod (mod v_main_~l~0_3 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {1329#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-07 17:50:52,743 INFO L290 TraceCheckUtils]: 19: Hoare triple {1329#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} [101] L29-->L29-2: Formula: (and (= (mod v_main_~l~0_4 2) 0) (= v_main_~j~0_1 (+ v_main_~j~0_2 1))) InVars {main_~l~0=v_main_~l~0_4, main_~j~0=v_main_~j~0_2} OutVars{main_~l~0=v_main_~l~0_4, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] {1329#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-07 17:50:52,745 INFO L290 TraceCheckUtils]: 20: Hoare triple {1329#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {1330#(<= (+ 2147483647 main_~l~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296)))} is VALID [2022-04-07 17:50:52,746 INFO L290 TraceCheckUtils]: 21: Hoare triple {1330#(<= (+ 2147483647 main_~l~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296)))} [84] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1319#false} is VALID [2022-04-07 17:50:52,746 INFO L272 TraceCheckUtils]: 22: Hoare triple {1319#false} [86] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~l~0_15 4294967296) (mod (+ v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~l~0=v_main_~l~0_15, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {1319#false} is VALID [2022-04-07 17:50:52,746 INFO L290 TraceCheckUtils]: 23: Hoare triple {1319#false} [90] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1319#false} is VALID [2022-04-07 17:50:52,746 INFO L290 TraceCheckUtils]: 24: Hoare triple {1319#false} [94] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1319#false} is VALID [2022-04-07 17:50:52,747 INFO L290 TraceCheckUtils]: 25: Hoare triple {1319#false} [98] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1319#false} is VALID [2022-04-07 17:50:52,747 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:50:52,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:50:52,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269702598] [2022-04-07 17:50:52,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269702598] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:50:52,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187057504] [2022-04-07 17:50:52,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:50:52,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:50:52,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:50:52,752 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 17:50:52,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-07 17:50:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:50:52,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-07 17:50:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:50:52,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:50:53,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {1318#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1318#true} is VALID [2022-04-07 17:50:53,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {1318#true} [76] 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] {1318#true} is VALID [2022-04-07 17:50:53,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {1318#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1318#true} is VALID [2022-04-07 17:50:53,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1318#true} {1318#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1318#true} is VALID [2022-04-07 17:50:53,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {1318#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1318#true} is VALID [2022-04-07 17:50:53,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {1318#true} [78] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (= v_main_~j~0_3 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {1351#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:50:53,427 INFO L290 TraceCheckUtils]: 6: Hoare triple {1351#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [81] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1351#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:50:53,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {1351#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1351#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:50:53,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {1351#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [87] L23-->L29-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_12 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {1361#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 17:50:53,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {1361#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {1365#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 17:50:53,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {1365#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1365#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 17:50:53,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {1365#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} [88] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_13 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_13} OutVars{main_~l~0=v_main_~l~0_13} AuxVars[] AssignedVars[] {1365#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 17:50:53,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {1365#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} [93] L25-->L27: Formula: (not (= (mod v_main_~l~0_1 4) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1365#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 17:50:53,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {1365#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} [96] L27-->L29-2: Formula: (and (= (mod (mod (mod v_main_~l~0_2 4294967296) 3) 4294967296) 0) (= v_main_~i~0_1 (+ v_main_~i~0_2 1))) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_2} AuxVars[] AssignedVars[main_~i~0] {1378#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-07 17:50:53,431 INFO L290 TraceCheckUtils]: 14: Hoare triple {1378#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {1382#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-07 17:50:53,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {1382#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1382#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-07 17:50:53,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {1382#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} [88] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_13 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_13} OutVars{main_~l~0=v_main_~l~0_13} AuxVars[] AssignedVars[] {1382#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-07 17:50:53,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {1382#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} [93] L25-->L27: Formula: (not (= (mod v_main_~l~0_1 4) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1382#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-07 17:50:53,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {1382#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} [97] L27-->L29: Formula: (not (= (mod (mod (mod v_main_~l~0_3 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {1382#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-07 17:50:53,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {1382#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} [101] L29-->L29-2: Formula: (and (= (mod v_main_~l~0_4 2) 0) (= v_main_~j~0_1 (+ v_main_~j~0_2 1))) InVars {main_~l~0=v_main_~l~0_4, main_~j~0=v_main_~j~0_2} OutVars{main_~l~0=v_main_~l~0_4, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] {1398#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-07 17:50:53,434 INFO L290 TraceCheckUtils]: 20: Hoare triple {1398#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {1402#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 1) (= main_~k~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= (+ main_~l~0 (- 3)) 0))} is VALID [2022-04-07 17:50:53,434 INFO L290 TraceCheckUtils]: 21: Hoare triple {1402#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 1) (= main_~k~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= (+ main_~l~0 (- 3)) 0))} [84] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1402#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 1) (= main_~k~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= (+ main_~l~0 (- 3)) 0))} is VALID [2022-04-07 17:50:53,435 INFO L272 TraceCheckUtils]: 22: Hoare triple {1402#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 1) (= main_~k~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= (+ main_~l~0 (- 3)) 0))} [86] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~l~0_15 4294967296) (mod (+ v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~l~0=v_main_~l~0_15, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {1409#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:50:53,435 INFO L290 TraceCheckUtils]: 23: Hoare triple {1409#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1413#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:50:53,438 INFO L290 TraceCheckUtils]: 24: Hoare triple {1413#(<= 1 __VERIFIER_assert_~cond)} [94] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1319#false} is VALID [2022-04-07 17:50:53,438 INFO L290 TraceCheckUtils]: 25: Hoare triple {1319#false} [98] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1319#false} is VALID [2022-04-07 17:50:53,438 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:50:53,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:50:53,902 INFO L290 TraceCheckUtils]: 25: Hoare triple {1319#false} [98] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1319#false} is VALID [2022-04-07 17:50:53,903 INFO L290 TraceCheckUtils]: 24: Hoare triple {1413#(<= 1 __VERIFIER_assert_~cond)} [94] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1319#false} is VALID [2022-04-07 17:50:53,903 INFO L290 TraceCheckUtils]: 23: Hoare triple {1409#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1413#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:50:53,904 INFO L272 TraceCheckUtils]: 22: Hoare triple {1429#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [86] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~l~0_15 4294967296) (mod (+ v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~l~0=v_main_~l~0_15, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {1409#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:50:53,905 INFO L290 TraceCheckUtils]: 21: Hoare triple {1429#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [84] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1429#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:53,906 INFO L290 TraceCheckUtils]: 20: Hoare triple {1436#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {1429#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:53,912 INFO L290 TraceCheckUtils]: 19: Hoare triple {1429#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [101] L29-->L29-2: Formula: (and (= (mod v_main_~l~0_4 2) 0) (= v_main_~j~0_1 (+ v_main_~j~0_2 1))) InVars {main_~l~0=v_main_~l~0_4, main_~j~0=v_main_~j~0_2} OutVars{main_~l~0=v_main_~l~0_4, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] {1436#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:53,913 INFO L290 TraceCheckUtils]: 18: Hoare triple {1429#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [97] L27-->L29: Formula: (not (= (mod (mod (mod v_main_~l~0_3 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {1429#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:53,913 INFO L290 TraceCheckUtils]: 17: Hoare triple {1429#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [93] L25-->L27: Formula: (not (= (mod v_main_~l~0_1 4) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1429#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:53,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {1429#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [88] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_13 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_13} OutVars{main_~l~0=v_main_~l~0_13} AuxVars[] AssignedVars[] {1429#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:53,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {1429#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1429#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:53,915 INFO L290 TraceCheckUtils]: 14: Hoare triple {1436#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {1429#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:56,021 WARN L290 TraceCheckUtils]: 13: Hoare triple {1429#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [96] L27-->L29-2: Formula: (and (= (mod (mod (mod v_main_~l~0_2 4294967296) 3) 4294967296) 0) (= v_main_~i~0_1 (+ v_main_~i~0_2 1))) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_2} AuxVars[] AssignedVars[main_~i~0] {1436#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-07 17:50:56,022 INFO L290 TraceCheckUtils]: 12: Hoare triple {1429#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [93] L25-->L27: Formula: (not (= (mod v_main_~l~0_1 4) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1429#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:56,022 INFO L290 TraceCheckUtils]: 11: Hoare triple {1429#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [88] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_13 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_13} OutVars{main_~l~0=v_main_~l~0_13} AuxVars[] AssignedVars[] {1429#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:56,023 INFO L290 TraceCheckUtils]: 10: Hoare triple {1429#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1429#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:56,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {1436#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [91] L29-2-->L21-2: Formula: (= (+ v_main_~l~0_8 1) v_main_~l~0_7) InVars {main_~l~0=v_main_~l~0_8} OutVars{main_~l~0=v_main_~l~0_7} AuxVars[] AssignedVars[main_~l~0] {1429#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:58,142 WARN L290 TraceCheckUtils]: 8: Hoare triple {1429#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [87] L23-->L29-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_12 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_12, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {1436#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-07 17:50:58,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {1429#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [85] L21-2-->L23: Formula: (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1429#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:58,143 INFO L290 TraceCheckUtils]: 6: Hoare triple {1429#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} [81] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1429#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:58,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {1318#true} [78] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (= v_main_~j~0_3 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {1429#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-07 17:50:58,144 INFO L272 TraceCheckUtils]: 4: Hoare triple {1318#true} [75] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1318#true} is VALID [2022-04-07 17:50:58,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1318#true} {1318#true} [103] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1318#true} is VALID [2022-04-07 17:50:58,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {1318#true} [79] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1318#true} is VALID [2022-04-07 17:50:58,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {1318#true} [76] 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] {1318#true} is VALID [2022-04-07 17:50:58,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {1318#true} [74] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1318#true} is VALID [2022-04-07 17:50:58,144 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-07 17:50:58,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187057504] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 17:50:58,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 17:50:58,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 11] total 23 [2022-04-07 17:50:58,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330870037] [2022-04-07 17:50:58,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:50:58,145 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 26 [2022-04-07 17:50:58,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:50:58,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-07 17:51:02,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 18 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 17:51:02,446 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:51:02,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:51:02,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:51:02,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2022-04-07 17:51:02,447 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-07 17:51:04,511 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-07 17:51:06,729 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-07 17:51:06,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:51:06,976 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2022-04-07 17:51:06,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 17:51:06,976 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 26 [2022-04-07 17:51:06,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:51:06,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-07 17:51:06,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2022-04-07 17:51:06,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-07 17:51:06,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2022-04-07 17:51:06,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 21 transitions. [2022-04-07 17:51:11,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 19 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 17:51:11,274 INFO L225 Difference]: With dead ends: 34 [2022-04-07 17:51:11,274 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 17:51:11,274 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2022-04-07 17:51:11,275 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-07 17:51:11,275 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 33 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 2 Unknown, 0 Unchecked, 4.4s Time] [2022-04-07 17:51:11,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 17:51:11,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 17:51:11,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:51:11,276 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-07 17:51:11,276 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-07 17:51:11,276 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-07 17:51:11,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:51:11,276 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 17:51:11,276 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 17:51:11,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:51:11,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:51:11,277 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-07 17:51:11,277 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-07 17:51:11,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:51:11,277 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 17:51:11,277 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 17:51:11,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:51:11,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:51:11,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:51:11,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:51:11,277 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-07 17:51:11,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 17:51:11,278 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2022-04-07 17:51:11,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:51:11,278 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 17:51:11,278 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-07 17:51:11,278 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 17:51:11,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:51:11,280 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 17:51:11,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-07 17:51:11,481 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:51:11,484 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:51:11,485 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 17:51:11,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 05:51:11 BasicIcfg [2022-04-07 17:51:11,487 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 17:51:11,488 INFO L158 Benchmark]: Toolchain (without parser) took 137914.58ms. Allocated memory was 174.1MB in the beginning and 228.6MB in the end (delta: 54.5MB). Free memory was 116.4MB in the beginning and 178.3MB in the end (delta: -61.9MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 17:51:11,488 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 174.1MB. Free memory is still 132.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 17:51:11,489 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.24ms. Allocated memory was 174.1MB in the beginning and 228.6MB in the end (delta: 54.5MB). Free memory was 116.1MB in the beginning and 199.8MB in the end (delta: -83.7MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. [2022-04-07 17:51:11,489 INFO L158 Benchmark]: Boogie Preprocessor took 47.43ms. Allocated memory is still 228.6MB. Free memory was 199.8MB in the beginning and 198.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 17:51:11,489 INFO L158 Benchmark]: RCFGBuilder took 4637.75ms. Allocated memory is still 228.6MB. Free memory was 198.2MB in the beginning and 186.2MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-07 17:51:11,489 INFO L158 Benchmark]: IcfgTransformer took 29.25ms. Allocated memory is still 228.6MB. Free memory was 185.6MB in the beginning and 184.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 17:51:11,490 INFO L158 Benchmark]: TraceAbstraction took 132877.29ms. Allocated memory is still 228.6MB. Free memory was 184.1MB in the beginning and 178.3MB in the end (delta: 5.8MB). Peak memory consumption was 7.1MB. Max. memory is 8.0GB. [2022-04-07 17:51:11,491 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.12ms. Allocated memory is still 174.1MB. Free memory is still 132.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 311.24ms. Allocated memory was 174.1MB in the beginning and 228.6MB in the end (delta: 54.5MB). Free memory was 116.1MB in the beginning and 199.8MB in the end (delta: -83.7MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.43ms. Allocated memory is still 228.6MB. Free memory was 199.8MB in the beginning and 198.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 4637.75ms. Allocated memory is still 228.6MB. Free memory was 198.2MB in the beginning and 186.2MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 29.25ms. Allocated memory is still 228.6MB. Free memory was 185.6MB in the beginning and 184.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 132877.29ms. Allocated memory is still 228.6MB. Free memory was 184.1MB in the beginning and 178.3MB in the end (delta: 5.8MB). Peak memory consumption was 7.1MB. 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, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 132.8s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 92.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 22 mSolverCounterUnknown, 88 SdHoareTripleChecker+Valid, 47.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 87 mSDsluCounter, 326 SdHoareTripleChecker+Invalid, 44.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 207 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 322 IncrementalHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 119 mSDtfsCounter, 322 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 275 GetRequests, 163 SyntacticMatches, 15 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=7, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 11 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 21.5s InterpolantComputationTime, 242 NumberOfCodeBlocks, 242 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 325 ConstructedInterpolants, 0 QuantifiedInterpolants, 3411 SizeOfPredicates, 5 NumberOfNonLiveVariables, 441 ConjunctsInSsa, 115 ConjunctsInUnsatCore, 18 InterpolantComputations, 8 PerfectInterpolantSequences, 37/91 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-07 17:51:11,515 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...