/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/loop-industry-pattern/mod3.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 16:27:01,913 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 16:27:01,914 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 16:27:01,951 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 16:27:01,952 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 16:27:01,952 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 16:27:01,967 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 16:27:01,968 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 16:27:01,969 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 16:27:01,969 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 16:27:01,970 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 16:27:01,971 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 16:27:01,971 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 16:27:01,972 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 16:27:01,972 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 16:27:01,973 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 16:27:01,973 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 16:27:01,974 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 16:27:01,977 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 16:27:01,981 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 16:27:01,984 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 16:27:01,987 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 16:27:01,989 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 16:27:01,990 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 16:27:01,992 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 16:27:01,997 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 16:27:01,997 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 16:27:01,998 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 16:27:01,998 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 16:27:01,998 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 16:27:01,999 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 16:27:01,999 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 16:27:02,001 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 16:27:02,001 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 16:27:02,001 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 16:27:02,003 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 16:27:02,003 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 16:27:02,004 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 16:27:02,004 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 16:27:02,004 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 16:27:02,004 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 16:27:02,006 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 16:27:02,006 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 16:27:02,013 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 16:27:02,014 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 16:27:02,014 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 16:27:02,014 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 16:27:02,015 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 16:27:02,015 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 16:27:02,015 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 16:27:02,015 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 16:27:02,015 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 16:27:02,015 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 16:27:02,016 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 16:27:02,016 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 16:27:02,016 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 16:27:02,016 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 16:27:02,016 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 16:27:02,016 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 16:27:02,016 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 16:27:02,016 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 16:27:02,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:27:02,016 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 16:27:02,016 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 16:27:02,017 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 16:27:02,018 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 16:27:02,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 16:27:02,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 16:27:02,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 16:27:02,222 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 16:27:02,225 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 16:27:02,226 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+sep-reducer.c [2022-04-27 16:27:02,271 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53d691119/81a65e88955549bb8532cfe6d319396a/FLAG50332c883 [2022-04-27 16:27:02,633 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 16:27:02,633 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+sep-reducer.c [2022-04-27 16:27:02,637 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53d691119/81a65e88955549bb8532cfe6d319396a/FLAG50332c883 [2022-04-27 16:27:03,072 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53d691119/81a65e88955549bb8532cfe6d319396a [2022-04-27 16:27:03,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 16:27:03,074 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 16:27:03,078 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 16:27:03,078 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 16:27:03,081 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 16:27:03,082 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:27:03" (1/1) ... [2022-04-27 16:27:03,083 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71d8b6c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:27:03, skipping insertion in model container [2022-04-27 16:27:03,083 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:27:03" (1/1) ... [2022-04-27 16:27:03,087 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 16:27:03,103 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 16:27:03,283 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+sep-reducer.c[2057,2070] [2022-04-27 16:27:03,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:27:03,299 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 16:27:03,330 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+sep-reducer.c[2057,2070] [2022-04-27 16:27:03,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:27:03,344 INFO L208 MainTranslator]: Completed translation [2022-04-27 16:27:03,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:27:03 WrapperNode [2022-04-27 16:27:03,345 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 16:27:03,346 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 16:27:03,346 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 16:27:03,346 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 16:27:03,353 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:27:03" (1/1) ... [2022-04-27 16:27:03,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:27:03" (1/1) ... [2022-04-27 16:27:03,362 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:27:03" (1/1) ... [2022-04-27 16:27:03,363 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:27:03" (1/1) ... [2022-04-27 16:27:03,376 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:27:03" (1/1) ... [2022-04-27 16:27:03,378 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:27:03" (1/1) ... [2022-04-27 16:27:03,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:27:03" (1/1) ... [2022-04-27 16:27:03,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 16:27:03,381 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 16:27:03,381 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 16:27:03,381 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 16:27:03,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:27:03" (1/1) ... [2022-04-27 16:27:03,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:27:03,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:27:03,404 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 16:27:03,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 16:27:03,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 16:27:03,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 16:27:03,438 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 16:27:03,439 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 16:27:03,439 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 16:27:03,439 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 16:27:03,439 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 16:27:03,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 16:27:03,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 16:27:03,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 16:27:03,440 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 16:27:03,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 16:27:03,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 16:27:03,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 16:27:03,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 16:27:03,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 16:27:03,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 16:27:03,519 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 16:27:03,520 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 16:27:12,381 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 16:27:12,386 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 16:27:12,387 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-27 16:27:12,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:27:12 BoogieIcfgContainer [2022-04-27 16:27:12,388 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 16:27:12,388 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 16:27:12,388 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 16:27:12,389 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 16:27:12,391 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:27:12" (1/1) ... [2022-04-27 16:27:12,392 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 16:27:12,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:27:12 BasicIcfg [2022-04-27 16:27:12,409 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 16:27:12,410 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 16:27:12,410 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 16:27:12,412 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 16:27:12,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 04:27:03" (1/4) ... [2022-04-27 16:27:12,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a4431fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:27:12, skipping insertion in model container [2022-04-27 16:27:12,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:27:03" (2/4) ... [2022-04-27 16:27:12,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a4431fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:27:12, skipping insertion in model container [2022-04-27 16:27:12,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:27:12" (3/4) ... [2022-04-27 16:27:12,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a4431fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:27:12, skipping insertion in model container [2022-04-27 16:27:12,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:27:12" (4/4) ... [2022-04-27 16:27:12,414 INFO L111 eAbstractionObserver]: Analyzing ICFG mod3.c.v+sep-reducer.cJordan [2022-04-27 16:27:12,423 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 16:27:12,423 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 16:27:12,449 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 16:27:12,453 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@64f9e900, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1b73cf7a [2022-04-27 16:27:12,453 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 16:27:12,458 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:27:12,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 16:27:12,463 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:27:12,463 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:27:12,463 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:27:12,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:27:12,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1219544613, now seen corresponding path program 1 times [2022-04-27 16:27:12,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:27:12,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789234412] [2022-04-27 16:27:12,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:27:12,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:27:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:27:12,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:27:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:27:13,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__tmp_31_0~0_4 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= 0 v_~__tmp_22_0~0_4) (= v_~__tmp_25_0~0_4 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= 0 v_~__return_main~0_4) (= 23 (select |v_#length_1| 2)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 0 v_~__tmp_22_1~0_4) (= v_~__tmp_28_0~0_4 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~__return_65~0_2 0) (= v_~__tmp_25_1~0_4 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_25_1~0=v_~__tmp_25_1~0_4, ~__tmp_25_0~0=v_~__tmp_25_0~0_4, ~__tmp_28_0~0=v_~__tmp_28_0~0_4, #NULL.offset=|v_#NULL.offset_1|, ~__return_65~0=v_~__return_65~0_2, #NULL.base=|v_#NULL.base_1|, ~__tmp_22_1~0=v_~__tmp_22_1~0_4, ~__tmp_22_0~0=v_~__tmp_22_0~0_4, ~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_31_0~0=v_~__tmp_31_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__tmp_25_1~0, ~__return_main~0, ~__tmp_25_0~0, ~__tmp_31_0~0, ~__tmp_28_0~0, #NULL.offset, ~__return_65~0, #NULL.base, ~__tmp_22_1~0, ~__tmp_22_0~0] {31#true} is VALID [2022-04-27 16:27:13,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 16:27:13,021 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 16:27:13,023 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:27:13,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__tmp_31_0~0_4 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= 0 v_~__tmp_22_0~0_4) (= v_~__tmp_25_0~0_4 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= 0 v_~__return_main~0_4) (= 23 (select |v_#length_1| 2)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 0 v_~__tmp_22_1~0_4) (= v_~__tmp_28_0~0_4 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~__return_65~0_2 0) (= v_~__tmp_25_1~0_4 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_25_1~0=v_~__tmp_25_1~0_4, ~__tmp_25_0~0=v_~__tmp_25_0~0_4, ~__tmp_28_0~0=v_~__tmp_28_0~0_4, #NULL.offset=|v_#NULL.offset_1|, ~__return_65~0=v_~__return_65~0_2, #NULL.base=|v_#NULL.base_1|, ~__tmp_22_1~0=v_~__tmp_22_1~0_4, ~__tmp_22_0~0=v_~__tmp_22_0~0_4, ~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_31_0~0=v_~__tmp_31_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__tmp_25_1~0, ~__return_main~0, ~__tmp_25_0~0, ~__tmp_31_0~0, ~__tmp_28_0~0, #NULL.offset, ~__return_65~0, #NULL.base, ~__tmp_22_1~0, ~__tmp_22_0~0] {31#true} is VALID [2022-04-27 16:27:13,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 16:27:13,024 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 16:27:13,024 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 16:27:13,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#true} [79] mainENTRY-->L138: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__x~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__y~0_1 1)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__x~0=v_main_~main__x~0_1, main_~main__y~0=v_main_~main__y~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__x~0, main_~main__y~0] {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} is VALID [2022-04-27 16:27:13,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} [81] L138-->L22: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} is VALID [2022-04-27 16:27:13,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} [82] L22-->L24: Formula: (not (= v_main_~main____CPAchecker_TMP_0~0_5 0)) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[] {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} is VALID [2022-04-27 16:27:15,163 WARN L290 TraceCheckUtils]: 8: Hoare triple {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} [84] L24-->L52: Formula: (and (= 0 v_main_~main__y~0_2) (= v_main_~main____CPAchecker_TMP_0~0_6 v_~__tmp_31_0~0_1) (= (+ 2 v_main_~main__x~0_3) v_main_~main__x~0_2) (= (mod (mod (mod v_main_~main__x~0_3 4294967296) 3) 4294967296) 1)) InVars {main_~main__x~0=v_main_~main__x~0_3, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6} OutVars{~__tmp_31_0~0=v_~__tmp_31_0~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~main__x~0=v_main_~main__x~0_2, main_~main__y~0=v_main_~main__y~0_2} AuxVars[] AssignedVars[~__tmp_31_0~0, main_~main__x~0, main_~main__y~0] {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is UNKNOWN [2022-04-27 16:27:15,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [87] L52-->L42: Formula: (= v_main_~main____CPAchecker_TMP_0~0_7 v_~__tmp_31_0~0_2) InVars {~__tmp_31_0~0=v_~__tmp_31_0~0_2} OutVars{~__tmp_31_0~0=v_~__tmp_31_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~0] {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 16:27:15,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [90] L42-->L45: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_0~1] {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 16:27:15,172 INFO L290 TraceCheckUtils]: 11: Hoare triple {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [95] L45-->L88: Formula: (= v_main_~main____CPAchecker_TMP_0~1_9 0) InVars {main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_9} OutVars{main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_9} AuxVars[] AssignedVars[] {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 16:27:15,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [100] L88-->L95: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= v_main_~__tmp_1~0_1 (ite (= (mod (mod (mod v_main_~main__x~0_17 4294967296) 3) 4294967296) 0) 1 0)) (= (mod v_main_~main__y~0_8 4294967296) 0)) InVars {main_~main__x~0=v_main_~main__x~0_17, main_~main__y~0=v_main_~main__y~0_8} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__x~0=v_main_~main__x~0_17, main_~main__y~0=v_main_~main__y~0_8, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {38#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-27 16:27:15,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {38#(not (= main_~__VERIFIER_assert__cond~0 0))} [104] L95-->L97: Formula: (= v_main_~__VERIFIER_assert__cond~0_3 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} AuxVars[] AssignedVars[] {32#false} is VALID [2022-04-27 16:27:15,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} [108] L97-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#false} is VALID [2022-04-27 16:27:15,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:27:15,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:27:15,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789234412] [2022-04-27 16:27:15,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789234412] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:27:15,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:27:15,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 16:27:15,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507147268] [2022-04-27 16:27:15,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:27:15,186 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 16:27:15,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:27:15,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:27:17,323 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-27 16:27:17,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:27:17,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:27:17,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:27:17,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:27:17,340 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:27:26,052 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-27 16:27:28,182 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:27:30,322 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:27:32,692 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-27 16:27:39,293 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-27 16:27:41,458 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:27:43,626 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:27:45,801 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:27:47,974 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:27:56,725 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-27 16:28:01,079 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:28:03,248 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:28:05,430 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-27 16:28:07,627 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-27 16:28:14,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:28:14,327 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2022-04-27 16:28:14,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 16:28:14,327 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 16:28:14,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:28:14,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:28:14,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-27 16:28:14,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:28:14,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-27 16:28:14,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 68 transitions. [2022-04-27 16:28:16,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 67 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 16:28:16,574 INFO L225 Difference]: With dead ends: 49 [2022-04-27 16:28:16,574 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 16:28:16,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 16:28:16,577 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 21 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.2s IncrementalHoareTripleChecker+Time [2022-04-27 16:28:16,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 95 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 14 Unknown, 0 Unchecked, 30.2s Time] [2022-04-27 16:28:16,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 16:28:16,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-04-27 16:28:16,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:28:16,598 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:28:16,598 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:28:16,598 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:28:16,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:28:16,601 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-04-27 16:28:16,601 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-04-27 16:28:16,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:28:16,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:28:16,602 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-27 16:28:16,602 INFO L87 Difference]: Start difference. First operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-27 16:28:16,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:28:16,605 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-04-27 16:28:16,605 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-04-27 16:28:16,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:28:16,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:28:16,605 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:28:16,605 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:28:16,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:28:16,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2022-04-27 16:28:16,608 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 15 [2022-04-27 16:28:16,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:28:16,608 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2022-04-27 16:28:16,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:28:16,608 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-04-27 16:28:16,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 16:28:16,609 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:28:16,609 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:28:16,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 16:28:16,609 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:28:16,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:28:16,610 INFO L85 PathProgramCache]: Analyzing trace with hash -791971888, now seen corresponding path program 1 times [2022-04-27 16:28:16,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:28:16,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282287647] [2022-04-27 16:28:16,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:28:16,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:28:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:28:16,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:28:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:28:17,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {205#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__tmp_31_0~0_4 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= 0 v_~__tmp_22_0~0_4) (= v_~__tmp_25_0~0_4 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= 0 v_~__return_main~0_4) (= 23 (select |v_#length_1| 2)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 0 v_~__tmp_22_1~0_4) (= v_~__tmp_28_0~0_4 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~__return_65~0_2 0) (= v_~__tmp_25_1~0_4 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_25_1~0=v_~__tmp_25_1~0_4, ~__tmp_25_0~0=v_~__tmp_25_0~0_4, ~__tmp_28_0~0=v_~__tmp_28_0~0_4, #NULL.offset=|v_#NULL.offset_1|, ~__return_65~0=v_~__return_65~0_2, #NULL.base=|v_#NULL.base_1|, ~__tmp_22_1~0=v_~__tmp_22_1~0_4, ~__tmp_22_0~0=v_~__tmp_22_0~0_4, ~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_31_0~0=v_~__tmp_31_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__tmp_25_1~0, ~__return_main~0, ~__tmp_25_0~0, ~__tmp_31_0~0, ~__tmp_28_0~0, #NULL.offset, ~__return_65~0, #NULL.base, ~__tmp_22_1~0, ~__tmp_22_0~0] {197#true} is VALID [2022-04-27 16:28:17,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {197#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#true} is VALID [2022-04-27 16:28:17,001 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {197#true} {197#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#true} is VALID [2022-04-27 16:28:17,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {197#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {205#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:28:17,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {205#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__tmp_31_0~0_4 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= 0 v_~__tmp_22_0~0_4) (= v_~__tmp_25_0~0_4 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= 0 v_~__return_main~0_4) (= 23 (select |v_#length_1| 2)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 0 v_~__tmp_22_1~0_4) (= v_~__tmp_28_0~0_4 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~__return_65~0_2 0) (= v_~__tmp_25_1~0_4 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_25_1~0=v_~__tmp_25_1~0_4, ~__tmp_25_0~0=v_~__tmp_25_0~0_4, ~__tmp_28_0~0=v_~__tmp_28_0~0_4, #NULL.offset=|v_#NULL.offset_1|, ~__return_65~0=v_~__return_65~0_2, #NULL.base=|v_#NULL.base_1|, ~__tmp_22_1~0=v_~__tmp_22_1~0_4, ~__tmp_22_0~0=v_~__tmp_22_0~0_4, ~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_31_0~0=v_~__tmp_31_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__tmp_25_1~0, ~__return_main~0, ~__tmp_25_0~0, ~__tmp_31_0~0, ~__tmp_28_0~0, #NULL.offset, ~__return_65~0, #NULL.base, ~__tmp_22_1~0, ~__tmp_22_0~0] {197#true} is VALID [2022-04-27 16:28:17,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {197#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#true} is VALID [2022-04-27 16:28:17,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {197#true} {197#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#true} is VALID [2022-04-27 16:28:17,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {197#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#true} is VALID [2022-04-27 16:28:17,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {197#true} [79] mainENTRY-->L138: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__x~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__y~0_1 1)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__x~0=v_main_~main__x~0_1, main_~main__y~0=v_main_~main__y~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__x~0, main_~main__y~0] {202#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} is VALID [2022-04-27 16:28:17,006 INFO L290 TraceCheckUtils]: 6: Hoare triple {202#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} [81] L138-->L22: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {202#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} is VALID [2022-04-27 16:28:17,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {202#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} [82] L22-->L24: Formula: (not (= v_main_~main____CPAchecker_TMP_0~0_5 0)) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[] {202#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} is VALID [2022-04-27 16:28:17,007 INFO L290 TraceCheckUtils]: 8: Hoare triple {202#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} [85] L24-->L35: Formula: (not (= (mod (mod (mod v_main_~main__x~0_4 4294967296) 3) 4294967296) 1)) InVars {main_~main__x~0=v_main_~main__x~0_4} OutVars{main_~main__x~0=v_main_~main__x~0_4} AuxVars[] AssignedVars[] {202#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} is VALID [2022-04-27 16:28:19,170 WARN L290 TraceCheckUtils]: 9: Hoare triple {202#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} [88] L35-->L61: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_8 v_~__tmp_28_0~0_1) (= (+ v_main_~main__x~0_6 1) v_main_~main__x~0_5) (= 2 (mod (mod (mod v_main_~main__x~0_6 4294967296) 3) 4294967296)) (= 0 v_main_~main__y~0_3)) InVars {main_~main__x~0=v_main_~main__x~0_6, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8, main_~main__x~0=v_main_~main__x~0_5, ~__tmp_28_0~0=v_~__tmp_28_0~0_1, main_~main__y~0=v_main_~main__y~0_3} AuxVars[] AssignedVars[~__tmp_28_0~0, main_~main__x~0, main_~main__y~0] {203#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is UNKNOWN [2022-04-27 16:28:19,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {203#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [91] L61-->L42: Formula: (= v_main_~main____CPAchecker_TMP_0~0_9 v_~__tmp_28_0~0_2) InVars {~__tmp_28_0~0=v_~__tmp_28_0~0_2} OutVars{~__tmp_28_0~0=v_~__tmp_28_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_9} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~0] {203#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 16:28:19,172 INFO L290 TraceCheckUtils]: 11: Hoare triple {203#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [90] L42-->L45: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_0~1] {203#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 16:28:19,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {203#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [95] L45-->L88: Formula: (= v_main_~main____CPAchecker_TMP_0~1_9 0) InVars {main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_9} OutVars{main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_9} AuxVars[] AssignedVars[] {203#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 16:28:19,178 INFO L290 TraceCheckUtils]: 13: Hoare triple {203#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [100] L88-->L95: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= v_main_~__tmp_1~0_1 (ite (= (mod (mod (mod v_main_~main__x~0_17 4294967296) 3) 4294967296) 0) 1 0)) (= (mod v_main_~main__y~0_8 4294967296) 0)) InVars {main_~main__x~0=v_main_~main__x~0_17, main_~main__y~0=v_main_~main__y~0_8} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__x~0=v_main_~main__x~0_17, main_~main__y~0=v_main_~main__y~0_8, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {204#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-27 16:28:19,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {204#(not (= main_~__VERIFIER_assert__cond~0 0))} [104] L95-->L97: Formula: (= v_main_~__VERIFIER_assert__cond~0_3 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} AuxVars[] AssignedVars[] {198#false} is VALID [2022-04-27 16:28:19,180 INFO L290 TraceCheckUtils]: 15: Hoare triple {198#false} [108] L97-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {198#false} is VALID [2022-04-27 16:28:19,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:28:19,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:28:19,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282287647] [2022-04-27 16:28:19,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282287647] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:28:19,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:28:19,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 16:28:19,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8043504] [2022-04-27 16:28:19,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:28:19,182 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 16:28:19,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:28:19,182 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:28:21,365 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-27 16:28:21,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:28:21,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:28:21,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:28:21,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:28:21,367 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:28:23,500 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-27 16:28:25,695 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-27 16:28:27,841 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-27 16:28:30,024 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-27 16:28:36,716 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-27 16:28:43,358 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-27 16:28:47,714 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-27 16:28:49,887 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:28:52,043 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:28:56,386 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-27 16:28:58,555 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:29:02,909 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-27 16:29:07,258 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-27 16:29:09,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:29:09,615 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-04-27 16:29:09,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 16:29:09,616 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 16:29:09,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:29:09,616 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:29:09,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2022-04-27 16:29:09,617 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:29:09,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2022-04-27 16:29:09,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 50 transitions. [2022-04-27 16:29:11,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 49 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 16:29:11,835 INFO L225 Difference]: With dead ends: 42 [2022-04-27 16:29:11,835 INFO L226 Difference]: Without dead ends: 40 [2022-04-27 16:29:11,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 16:29:11,836 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.4s IncrementalHoareTripleChecker+Time [2022-04-27 16:29:11,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 81 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 13 Unknown, 0 Unchecked, 27.4s Time] [2022-04-27 16:29:11,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-27 16:29:11,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2022-04-27 16:29:11,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:29:11,839 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:29:11,839 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:29:11,840 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:29:11,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:29:11,841 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-27 16:29:11,841 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-27 16:29:11,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:29:11,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:29:11,842 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-27 16:29:11,842 INFO L87 Difference]: Start difference. First operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-27 16:29:11,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:29:11,845 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-27 16:29:11,845 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-27 16:29:11,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:29:11,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:29:11,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:29:11,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:29:11,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:29:11,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-04-27 16:29:11,847 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 16 [2022-04-27 16:29:11,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:29:11,847 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-04-27 16:29:11,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:29:11,847 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-04-27 16:29:11,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 16:29:11,847 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:29:11,848 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:29:11,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 16:29:11,848 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:29:11,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:29:11,848 INFO L85 PathProgramCache]: Analyzing trace with hash 364986418, now seen corresponding path program 1 times [2022-04-27 16:29:11,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:29:11,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190986913] [2022-04-27 16:29:11,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:29:11,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:29:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:29:11,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:29:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:29:11,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {375#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__tmp_31_0~0_4 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= 0 v_~__tmp_22_0~0_4) (= v_~__tmp_25_0~0_4 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= 0 v_~__return_main~0_4) (= 23 (select |v_#length_1| 2)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 0 v_~__tmp_22_1~0_4) (= v_~__tmp_28_0~0_4 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~__return_65~0_2 0) (= v_~__tmp_25_1~0_4 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_25_1~0=v_~__tmp_25_1~0_4, ~__tmp_25_0~0=v_~__tmp_25_0~0_4, ~__tmp_28_0~0=v_~__tmp_28_0~0_4, #NULL.offset=|v_#NULL.offset_1|, ~__return_65~0=v_~__return_65~0_2, #NULL.base=|v_#NULL.base_1|, ~__tmp_22_1~0=v_~__tmp_22_1~0_4, ~__tmp_22_0~0=v_~__tmp_22_0~0_4, ~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_31_0~0=v_~__tmp_31_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__tmp_25_1~0, ~__return_main~0, ~__tmp_25_0~0, ~__tmp_31_0~0, ~__tmp_28_0~0, #NULL.offset, ~__return_65~0, #NULL.base, ~__tmp_22_1~0, ~__tmp_22_0~0] {368#true} is VALID [2022-04-27 16:29:11,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {368#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {368#true} is VALID [2022-04-27 16:29:11,997 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {368#true} {368#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {368#true} is VALID [2022-04-27 16:29:11,998 INFO L272 TraceCheckUtils]: 0: Hoare triple {368#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {375#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:29:11,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {375#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__tmp_31_0~0_4 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= 0 v_~__tmp_22_0~0_4) (= v_~__tmp_25_0~0_4 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= 0 v_~__return_main~0_4) (= 23 (select |v_#length_1| 2)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 0 v_~__tmp_22_1~0_4) (= v_~__tmp_28_0~0_4 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~__return_65~0_2 0) (= v_~__tmp_25_1~0_4 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_25_1~0=v_~__tmp_25_1~0_4, ~__tmp_25_0~0=v_~__tmp_25_0~0_4, ~__tmp_28_0~0=v_~__tmp_28_0~0_4, #NULL.offset=|v_#NULL.offset_1|, ~__return_65~0=v_~__return_65~0_2, #NULL.base=|v_#NULL.base_1|, ~__tmp_22_1~0=v_~__tmp_22_1~0_4, ~__tmp_22_0~0=v_~__tmp_22_0~0_4, ~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_31_0~0=v_~__tmp_31_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__tmp_25_1~0, ~__return_main~0, ~__tmp_25_0~0, ~__tmp_31_0~0, ~__tmp_28_0~0, #NULL.offset, ~__return_65~0, #NULL.base, ~__tmp_22_1~0, ~__tmp_22_0~0] {368#true} is VALID [2022-04-27 16:29:11,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {368#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {368#true} is VALID [2022-04-27 16:29:12,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {368#true} {368#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {368#true} is VALID [2022-04-27 16:29:12,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {368#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {368#true} is VALID [2022-04-27 16:29:12,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {368#true} [79] mainENTRY-->L138: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__x~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__y~0_1 1)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__x~0=v_main_~main__x~0_1, main_~main__y~0=v_main_~main__y~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__x~0, main_~main__y~0] {368#true} is VALID [2022-04-27 16:29:12,000 INFO L290 TraceCheckUtils]: 6: Hoare triple {368#true} [81] L138-->L22: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {368#true} is VALID [2022-04-27 16:29:12,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {368#true} [82] L22-->L24: Formula: (not (= v_main_~main____CPAchecker_TMP_0~0_5 0)) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[] {368#true} is VALID [2022-04-27 16:29:12,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {368#true} [85] L24-->L35: Formula: (not (= (mod (mod (mod v_main_~main__x~0_4 4294967296) 3) 4294967296) 1)) InVars {main_~main__x~0=v_main_~main__x~0_4} OutVars{main_~main__x~0=v_main_~main__x~0_4} AuxVars[] AssignedVars[] {368#true} is VALID [2022-04-27 16:29:12,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {368#true} [89] L35-->L117: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (not (= 2 (mod (mod (mod v_main_~main__x~0_18 4294967296) 3) 4294967296))) (= v_main_~main____CPAchecker_TMP_1~1_1 |v_main_#t~nondet8_2|)) InVars {main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__x~0=v_main_~main__x~0_18} OutVars{main_~main__x~0=v_main_~main__x~0_18, main_~main____CPAchecker_TMP_1~1=v_main_~main____CPAchecker_TMP_1~1_1} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~1, main_#t~nondet8] {368#true} is VALID [2022-04-27 16:29:12,001 INFO L290 TraceCheckUtils]: 10: Hoare triple {368#true} [92] L117-->L123: Formula: (and (= (+ v_main_~main__x~0_20 4) v_main_~main__x~0_19) (= v_main_~main__y~0_10 1) (= v_main_~main____CPAchecker_TMP_1~1_3 v_~__tmp_22_1~0_2) (= v_main_~main____CPAchecker_TMP_0~0_10 v_~__tmp_22_0~0_2) (not (= v_main_~main____CPAchecker_TMP_1~1_3 0))) InVars {main_~main____CPAchecker_TMP_1~1=v_main_~main____CPAchecker_TMP_1~1_3, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_10, main_~main__x~0=v_main_~main__x~0_20} OutVars{main_~main____CPAchecker_TMP_1~1=v_main_~main____CPAchecker_TMP_1~1_3, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_10, main_~main__x~0=v_main_~main__x~0_19, main_~main__y~0=v_main_~main__y~0_10, ~__tmp_22_1~0=v_~__tmp_22_1~0_2, ~__tmp_22_0~0=v_~__tmp_22_0~0_2} AuxVars[] AssignedVars[main_~main__x~0, main_~main__y~0, ~__tmp_22_1~0, ~__tmp_22_0~0] {368#true} is VALID [2022-04-27 16:29:12,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {368#true} [96] L123-->L138: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_11 v_~__tmp_22_0~0_3) (= v_main_~main____CPAchecker_TMP_1~1_4 v_~__tmp_22_1~0_3)) InVars {~__tmp_22_1~0=v_~__tmp_22_1~0_3, ~__tmp_22_0~0=v_~__tmp_22_0~0_3} OutVars{main_~main____CPAchecker_TMP_1~1=v_main_~main____CPAchecker_TMP_1~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_11, ~__tmp_22_1~0=v_~__tmp_22_1~0_3, ~__tmp_22_0~0=v_~__tmp_22_0~0_3} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~1, main_~main____CPAchecker_TMP_0~0] {368#true} is VALID [2022-04-27 16:29:12,001 INFO L290 TraceCheckUtils]: 12: Hoare triple {368#true} [81] L138-->L22: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {368#true} is VALID [2022-04-27 16:29:12,001 INFO L290 TraceCheckUtils]: 13: Hoare triple {368#true} [82] L22-->L24: Formula: (not (= v_main_~main____CPAchecker_TMP_0~0_5 0)) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[] {368#true} is VALID [2022-04-27 16:29:14,170 WARN L290 TraceCheckUtils]: 14: Hoare triple {368#true} [84] L24-->L52: Formula: (and (= 0 v_main_~main__y~0_2) (= v_main_~main____CPAchecker_TMP_0~0_6 v_~__tmp_31_0~0_1) (= (+ 2 v_main_~main__x~0_3) v_main_~main__x~0_2) (= (mod (mod (mod v_main_~main__x~0_3 4294967296) 3) 4294967296) 1)) InVars {main_~main__x~0=v_main_~main__x~0_3, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6} OutVars{~__tmp_31_0~0=v_~__tmp_31_0~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~main__x~0=v_main_~main__x~0_2, main_~main__y~0=v_main_~main__y~0_2} AuxVars[] AssignedVars[~__tmp_31_0~0, main_~main__x~0, main_~main__y~0] {373#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is UNKNOWN [2022-04-27 16:29:14,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {373#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [87] L52-->L42: Formula: (= v_main_~main____CPAchecker_TMP_0~0_7 v_~__tmp_31_0~0_2) InVars {~__tmp_31_0~0=v_~__tmp_31_0~0_2} OutVars{~__tmp_31_0~0=v_~__tmp_31_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~0] {373#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 16:29:14,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {373#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [90] L42-->L45: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_0~1] {373#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 16:29:14,174 INFO L290 TraceCheckUtils]: 17: Hoare triple {373#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [95] L45-->L88: Formula: (= v_main_~main____CPAchecker_TMP_0~1_9 0) InVars {main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_9} OutVars{main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_9} AuxVars[] AssignedVars[] {373#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 16:29:14,180 INFO L290 TraceCheckUtils]: 18: Hoare triple {373#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [100] L88-->L95: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= v_main_~__tmp_1~0_1 (ite (= (mod (mod (mod v_main_~main__x~0_17 4294967296) 3) 4294967296) 0) 1 0)) (= (mod v_main_~main__y~0_8 4294967296) 0)) InVars {main_~main__x~0=v_main_~main__x~0_17, main_~main__y~0=v_main_~main__y~0_8} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__x~0=v_main_~main__x~0_17, main_~main__y~0=v_main_~main__y~0_8, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {374#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-27 16:29:14,180 INFO L290 TraceCheckUtils]: 19: Hoare triple {374#(not (= main_~__VERIFIER_assert__cond~0 0))} [104] L95-->L97: Formula: (= v_main_~__VERIFIER_assert__cond~0_3 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} AuxVars[] AssignedVars[] {369#false} is VALID [2022-04-27 16:29:14,181 INFO L290 TraceCheckUtils]: 20: Hoare triple {369#false} [108] L97-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369#false} is VALID [2022-04-27 16:29:14,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 16:29:14,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:29:14,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190986913] [2022-04-27 16:29:14,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190986913] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:29:14,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:29:14,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 16:29:14,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771255245] [2022-04-27 16:29:14,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:29:14,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 16:29:14,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:29:14,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:29:16,384 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-27 16:29:16,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 16:29:16,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:29:16,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 16:29:16,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 16:29:16,385 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:29:20,598 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-27 16:29:22,767 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:29:27,134 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-27 16:29:31,487 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-27 16:29:33,664 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-27 16:29:35,932 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:29:38,031 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-27 16:29:40,238 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-27 16:29:44,636 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-27 16:29:48,986 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-27 16:29:53,341 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-27 16:29:57,694 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-27 16:30:02,038 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-27 16:30:02,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:30:02,220 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-04-27 16:30:02,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 16:30:02,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 16:30:02,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:30:02,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:30:02,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 16:30:02,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:30:02,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 16:30:02,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-27 16:30:06,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 48 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 16:30:06,617 INFO L225 Difference]: With dead ends: 47 [2022-04-27 16:30:06,617 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 16:30:06,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:30:06,618 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:30:06,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 56 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 12 Unknown, 0 Unchecked, 27.1s Time] [2022-04-27 16:30:06,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 16:30:06,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2022-04-27 16:30:06,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:30:06,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:30:06,621 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:30:06,621 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:30:06,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:30:06,623 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-04-27 16:30:06,623 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-04-27 16:30:06,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:30:06,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:30:06,623 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-27 16:30:06,623 INFO L87 Difference]: Start difference. First operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-27 16:30:06,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:30:06,625 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-04-27 16:30:06,625 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-04-27 16:30:06,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:30:06,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:30:06,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:30:06,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:30:06,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:30:06,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-04-27 16:30:06,627 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 21 [2022-04-27 16:30:06,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:30:06,627 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-04-27 16:30:06,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:30:06,627 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-04-27 16:30:06,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 16:30:06,628 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:30:06,628 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:30:06,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 16:30:06,628 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:30:06,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:30:06,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1083849817, now seen corresponding path program 1 times [2022-04-27 16:30:06,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:30:06,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111938836] [2022-04-27 16:30:06,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:30:06,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:30:06,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:30:06,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:30:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:30:06,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {558#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__tmp_31_0~0_4 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= 0 v_~__tmp_22_0~0_4) (= v_~__tmp_25_0~0_4 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= 0 v_~__return_main~0_4) (= 23 (select |v_#length_1| 2)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 0 v_~__tmp_22_1~0_4) (= v_~__tmp_28_0~0_4 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~__return_65~0_2 0) (= v_~__tmp_25_1~0_4 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_25_1~0=v_~__tmp_25_1~0_4, ~__tmp_25_0~0=v_~__tmp_25_0~0_4, ~__tmp_28_0~0=v_~__tmp_28_0~0_4, #NULL.offset=|v_#NULL.offset_1|, ~__return_65~0=v_~__return_65~0_2, #NULL.base=|v_#NULL.base_1|, ~__tmp_22_1~0=v_~__tmp_22_1~0_4, ~__tmp_22_0~0=v_~__tmp_22_0~0_4, ~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_31_0~0=v_~__tmp_31_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__tmp_25_1~0, ~__return_main~0, ~__tmp_25_0~0, ~__tmp_31_0~0, ~__tmp_28_0~0, #NULL.offset, ~__return_65~0, #NULL.base, ~__tmp_22_1~0, ~__tmp_22_0~0] {551#true} is VALID [2022-04-27 16:30:06,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {551#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {551#true} is VALID [2022-04-27 16:30:06,826 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {551#true} {551#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {551#true} is VALID [2022-04-27 16:30:06,827 INFO L272 TraceCheckUtils]: 0: Hoare triple {551#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {558#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:30:06,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {558#(and (= |old(~__tmp_28_0~0)| ~__tmp_28_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_65~0)| ~__return_65~0) (= |old(~__tmp_31_0~0)| ~__tmp_31_0~0) (= |old(~__tmp_22_1~0)| ~__tmp_22_1~0) (= |old(~__tmp_25_1~0)| ~__tmp_25_1~0) (= |old(~__tmp_25_0~0)| ~__tmp_25_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_22_0~0)| ~__tmp_22_0~0) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= v_~__tmp_31_0~0_4 0) (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= 0 v_~__tmp_22_0~0_4) (= v_~__tmp_25_0~0_4 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= 0 v_~__return_main~0_4) (= 23 (select |v_#length_1| 2)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 0 v_~__tmp_22_1~0_4) (= v_~__tmp_28_0~0_4 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~__return_65~0_2 0) (= v_~__tmp_25_1~0_4 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_25_1~0=v_~__tmp_25_1~0_4, ~__tmp_25_0~0=v_~__tmp_25_0~0_4, ~__tmp_28_0~0=v_~__tmp_28_0~0_4, #NULL.offset=|v_#NULL.offset_1|, ~__return_65~0=v_~__return_65~0_2, #NULL.base=|v_#NULL.base_1|, ~__tmp_22_1~0=v_~__tmp_22_1~0_4, ~__tmp_22_0~0=v_~__tmp_22_0~0_4, ~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_31_0~0=v_~__tmp_31_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__tmp_25_1~0, ~__return_main~0, ~__tmp_25_0~0, ~__tmp_31_0~0, ~__tmp_28_0~0, #NULL.offset, ~__return_65~0, #NULL.base, ~__tmp_22_1~0, ~__tmp_22_0~0] {551#true} is VALID [2022-04-27 16:30:06,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {551#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {551#true} is VALID [2022-04-27 16:30:06,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {551#true} {551#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {551#true} is VALID [2022-04-27 16:30:06,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {551#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {551#true} is VALID [2022-04-27 16:30:06,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {551#true} [79] mainENTRY-->L138: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__x~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~main__y~0_1 1)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__x~0=v_main_~main__x~0_1, main_~main__y~0=v_main_~main__y~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~main__x~0, main_~main__y~0] {551#true} is VALID [2022-04-27 16:30:06,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {551#true} [81] L138-->L22: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {551#true} is VALID [2022-04-27 16:30:06,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {551#true} [82] L22-->L24: Formula: (not (= v_main_~main____CPAchecker_TMP_0~0_5 0)) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[] {551#true} is VALID [2022-04-27 16:30:06,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {551#true} [85] L24-->L35: Formula: (not (= (mod (mod (mod v_main_~main__x~0_4 4294967296) 3) 4294967296) 1)) InVars {main_~main__x~0=v_main_~main__x~0_4} OutVars{main_~main__x~0=v_main_~main__x~0_4} AuxVars[] AssignedVars[] {551#true} is VALID [2022-04-27 16:30:06,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {551#true} [89] L35-->L117: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (not (= 2 (mod (mod (mod v_main_~main__x~0_18 4294967296) 3) 4294967296))) (= v_main_~main____CPAchecker_TMP_1~1_1 |v_main_#t~nondet8_2|)) InVars {main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__x~0=v_main_~main__x~0_18} OutVars{main_~main__x~0=v_main_~main__x~0_18, main_~main____CPAchecker_TMP_1~1=v_main_~main____CPAchecker_TMP_1~1_1} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~1, main_#t~nondet8] {551#true} is VALID [2022-04-27 16:30:06,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {551#true} [92] L117-->L123: Formula: (and (= (+ v_main_~main__x~0_20 4) v_main_~main__x~0_19) (= v_main_~main__y~0_10 1) (= v_main_~main____CPAchecker_TMP_1~1_3 v_~__tmp_22_1~0_2) (= v_main_~main____CPAchecker_TMP_0~0_10 v_~__tmp_22_0~0_2) (not (= v_main_~main____CPAchecker_TMP_1~1_3 0))) InVars {main_~main____CPAchecker_TMP_1~1=v_main_~main____CPAchecker_TMP_1~1_3, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_10, main_~main__x~0=v_main_~main__x~0_20} OutVars{main_~main____CPAchecker_TMP_1~1=v_main_~main____CPAchecker_TMP_1~1_3, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_10, main_~main__x~0=v_main_~main__x~0_19, main_~main__y~0=v_main_~main__y~0_10, ~__tmp_22_1~0=v_~__tmp_22_1~0_2, ~__tmp_22_0~0=v_~__tmp_22_0~0_2} AuxVars[] AssignedVars[main_~main__x~0, main_~main__y~0, ~__tmp_22_1~0, ~__tmp_22_0~0] {551#true} is VALID [2022-04-27 16:30:06,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {551#true} [96] L123-->L138: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_11 v_~__tmp_22_0~0_3) (= v_main_~main____CPAchecker_TMP_1~1_4 v_~__tmp_22_1~0_3)) InVars {~__tmp_22_1~0=v_~__tmp_22_1~0_3, ~__tmp_22_0~0=v_~__tmp_22_0~0_3} OutVars{main_~main____CPAchecker_TMP_1~1=v_main_~main____CPAchecker_TMP_1~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_11, ~__tmp_22_1~0=v_~__tmp_22_1~0_3, ~__tmp_22_0~0=v_~__tmp_22_0~0_3} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~1, main_~main____CPAchecker_TMP_0~0] {551#true} is VALID [2022-04-27 16:30:06,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {551#true} [81] L138-->L22: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 |v_main_#t~nondet5_2|) (<= |v_main_#t~nondet5_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {551#true} is VALID [2022-04-27 16:30:06,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {551#true} [82] L22-->L24: Formula: (not (= v_main_~main____CPAchecker_TMP_0~0_5 0)) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[] {551#true} is VALID [2022-04-27 16:30:06,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {551#true} [85] L24-->L35: Formula: (not (= (mod (mod (mod v_main_~main__x~0_4 4294967296) 3) 4294967296) 1)) InVars {main_~main__x~0=v_main_~main__x~0_4} OutVars{main_~main__x~0=v_main_~main__x~0_4} AuxVars[] AssignedVars[] {551#true} is VALID [2022-04-27 16:30:09,014 WARN L290 TraceCheckUtils]: 15: Hoare triple {551#true} [88] L35-->L61: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_8 v_~__tmp_28_0~0_1) (= (+ v_main_~main__x~0_6 1) v_main_~main__x~0_5) (= 2 (mod (mod (mod v_main_~main__x~0_6 4294967296) 3) 4294967296)) (= 0 v_main_~main__y~0_3)) InVars {main_~main__x~0=v_main_~main__x~0_6, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8, main_~main__x~0=v_main_~main__x~0_5, ~__tmp_28_0~0=v_~__tmp_28_0~0_1, main_~main__y~0=v_main_~main__y~0_3} AuxVars[] AssignedVars[~__tmp_28_0~0, main_~main__x~0, main_~main__y~0] {556#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is UNKNOWN [2022-04-27 16:30:09,015 INFO L290 TraceCheckUtils]: 16: Hoare triple {556#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [91] L61-->L42: Formula: (= v_main_~main____CPAchecker_TMP_0~0_9 v_~__tmp_28_0~0_2) InVars {~__tmp_28_0~0=v_~__tmp_28_0~0_2} OutVars{~__tmp_28_0~0=v_~__tmp_28_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_9} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~0] {556#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 16:30:09,016 INFO L290 TraceCheckUtils]: 17: Hoare triple {556#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [90] L42-->L45: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_0~1] {556#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 16:30:09,016 INFO L290 TraceCheckUtils]: 18: Hoare triple {556#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [95] L45-->L88: Formula: (= v_main_~main____CPAchecker_TMP_0~1_9 0) InVars {main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_9} OutVars{main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_9} AuxVars[] AssignedVars[] {556#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 16:30:09,022 INFO L290 TraceCheckUtils]: 19: Hoare triple {556#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} [100] L88-->L95: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= v_main_~__tmp_1~0_1 (ite (= (mod (mod (mod v_main_~main__x~0_17 4294967296) 3) 4294967296) 0) 1 0)) (= (mod v_main_~main__y~0_8 4294967296) 0)) InVars {main_~main__x~0=v_main_~main__x~0_17, main_~main__y~0=v_main_~main__y~0_8} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__x~0=v_main_~main__x~0_17, main_~main__y~0=v_main_~main__y~0_8, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {557#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-27 16:30:09,022 INFO L290 TraceCheckUtils]: 20: Hoare triple {557#(not (= main_~__VERIFIER_assert__cond~0 0))} [104] L95-->L97: Formula: (= v_main_~__VERIFIER_assert__cond~0_3 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} AuxVars[] AssignedVars[] {552#false} is VALID [2022-04-27 16:30:09,023 INFO L290 TraceCheckUtils]: 21: Hoare triple {552#false} [108] L97-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {552#false} is VALID [2022-04-27 16:30:09,023 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 16:30:09,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:30:09,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111938836] [2022-04-27 16:30:09,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111938836] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:30:09,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:30:09,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 16:30:09,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324392501] [2022-04-27 16:30:09,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:30:09,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 16:30:09,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:30:09,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:30:11,215 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-27 16:30:11,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 16:30:11,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:30:11,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 16:30:11,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 16:30:11,216 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:30:15,448 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-27 16:30:19,800 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-27 16:30:21,976 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-27 16:30:26,324 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-27 16:30:30,676 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-27 16:30:32,911 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-27 16:30:35,084 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 16:30:35,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:30:35,343 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2022-04-27 16:30:35,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 16:30:35,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 16:30:35,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:30:35,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:30:35,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-27 16:30:35,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:30:35,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-27 16:30:35,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2022-04-27 16:30:39,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 41 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 16:30:39,748 INFO L225 Difference]: With dead ends: 37 [2022-04-27 16:30:39,748 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 16:30:39,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:30:39,748 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2022-04-27 16:30:39,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 57 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 7 Unknown, 0 Unchecked, 14.6s Time] [2022-04-27 16:30:39,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 16:30:39,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 16:30:39,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:30:39,749 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-27 16:30:39,749 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-27 16:30:39,750 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-27 16:30:39,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:30:39,750 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:30:39,750 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:30:39,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:30:39,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:30:39,750 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-27 16:30:39,750 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-27 16:30:39,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:30:39,750 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:30:39,750 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:30:39,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:30:39,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:30:39,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:30:39,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:30:39,751 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-27 16:30:39,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 16:30:39,751 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-04-27 16:30:39,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:30:39,751 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 16:30:39,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:30:39,751 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:30:39,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:30:39,753 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 16:30:39,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 16:30:39,765 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-04-27 16:30:39,766 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 16:30:39,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:30:39 BasicIcfg [2022-04-27 16:30:39,768 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 16:30:39,769 INFO L158 Benchmark]: Toolchain (without parser) took 216694.70ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 134.8MB in the beginning and 124.8MB in the end (delta: 10.0MB). Peak memory consumption was 47.2MB. Max. memory is 8.0GB. [2022-04-27 16:30:39,769 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 182.5MB. Free memory is still 151.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 16:30:39,769 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.85ms. Allocated memory is still 182.5MB. Free memory was 134.5MB in the beginning and 158.9MB in the end (delta: -24.4MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. [2022-04-27 16:30:39,769 INFO L158 Benchmark]: Boogie Preprocessor took 34.67ms. Allocated memory is still 182.5MB. Free memory was 158.9MB in the beginning and 157.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 16:30:39,770 INFO L158 Benchmark]: RCFGBuilder took 9007.28ms. Allocated memory is still 182.5MB. Free memory was 157.3MB in the beginning and 143.7MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-27 16:30:39,770 INFO L158 Benchmark]: IcfgTransformer took 20.77ms. Allocated memory is still 182.5MB. Free memory was 143.7MB in the beginning and 142.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 16:30:39,770 INFO L158 Benchmark]: TraceAbstraction took 207358.08ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 141.6MB in the beginning and 124.8MB in the end (delta: 16.8MB). Peak memory consumption was 54.0MB. Max. memory is 8.0GB. [2022-04-27 16:30:39,771 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 182.5MB. Free memory is still 151.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 266.85ms. Allocated memory is still 182.5MB. Free memory was 134.5MB in the beginning and 158.9MB in the end (delta: -24.4MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.67ms. Allocated memory is still 182.5MB. Free memory was 158.9MB in the beginning and 157.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 9007.28ms. Allocated memory is still 182.5MB. Free memory was 157.3MB in the beginning and 143.7MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 20.77ms. Allocated memory is still 182.5MB. Free memory was 143.7MB in the beginning and 142.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 207358.08ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 141.6MB in the beginning and 124.8MB in the end (delta: 16.8MB). Peak memory consumption was 54.0MB. 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: 97]: 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 3 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 207.3s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 188.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 46 mSolverCounterUnknown, 49 SdHoareTripleChecker+Valid, 99.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49 mSDsluCounter, 289 SdHoareTripleChecker+Invalid, 94.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 185 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 258 IncrementalHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 104 mSDtfsCounter, 258 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=2, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 20 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 1163 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 7/7 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-27 16:30:39,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...