/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+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 19:26:39,429 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 19:26:39,430 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 19:26:39,448 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 19:26:39,448 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 19:26:39,449 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 19:26:39,449 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 19:26:39,451 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 19:26:39,452 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 19:26:39,452 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 19:26:39,453 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 19:26:39,456 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 19:26:39,456 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 19:26:39,460 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 19:26:39,461 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 19:26:39,463 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 19:26:39,463 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 19:26:39,464 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 19:26:39,469 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 19:26:39,473 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 19:26:39,473 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 19:26:39,474 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 19:26:39,474 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 19:26:39,475 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 19:26:39,475 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 19:26:39,477 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 19:26:39,477 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 19:26:39,477 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 19:26:39,478 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 19:26:39,478 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 19:26:39,478 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 19:26:39,478 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 19:26:39,479 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 19:26:39,479 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 19:26:39,480 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 19:26:39,480 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 19:26:39,480 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 19:26:39,481 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 19:26:39,481 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 19:26:39,481 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 19:26:39,481 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 19:26:39,495 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 19:26:39,496 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-14 19:26:39,506 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 19:26:39,506 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 19:26:39,507 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 19:26:39,507 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 19:26:39,507 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 19:26:39,507 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 19:26:39,508 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 19:26:39,508 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 19:26:39,508 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 19:26:39,508 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 19:26:39,509 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 19:26:39,509 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 19:26:39,509 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 19:26:39,509 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 19:26:39,509 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 19:26:39,509 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 19:26:39,509 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 19:26:39,509 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 19:26:39,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 19:26:39,509 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 19:26:39,510 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 19:26:39,510 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 19:26:39,510 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-14 19:26:39,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 19:26:39,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 19:26:39,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 19:26:39,673 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 19:26:39,674 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 19:26:39,674 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+lhb-reducer.c [2022-04-14 19:26:39,713 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c922740d/c4bf5dc0e5c64862aba818b35d5a7580/FLAG3457fe2b6 [2022-04-14 19:26:40,051 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 19:26:40,051 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+lhb-reducer.c [2022-04-14 19:26:40,065 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c922740d/c4bf5dc0e5c64862aba818b35d5a7580/FLAG3457fe2b6 [2022-04-14 19:26:40,075 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c922740d/c4bf5dc0e5c64862aba818b35d5a7580 [2022-04-14 19:26:40,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 19:26:40,077 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 19:26:40,078 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 19:26:40,078 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 19:26:40,081 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 19:26:40,084 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 07:26:40" (1/1) ... [2022-04-14 19:26:40,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3198e3c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:26:40, skipping insertion in model container [2022-04-14 19:26:40,086 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 07:26:40" (1/1) ... [2022-04-14 19:26:40,090 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 19:26:40,107 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 19:26:40,277 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+lhb-reducer.c[2265,2278] [2022-04-14 19:26:40,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 19:26:40,294 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 19:26:40,320 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+lhb-reducer.c[2265,2278] [2022-04-14 19:26:40,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 19:26:40,336 INFO L208 MainTranslator]: Completed translation [2022-04-14 19:26:40,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:26:40 WrapperNode [2022-04-14 19:26:40,336 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 19:26:40,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 19:26:40,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 19:26:40,337 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 19:26:40,347 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:26:40" (1/1) ... [2022-04-14 19:26:40,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:26:40" (1/1) ... [2022-04-14 19:26:40,354 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:26:40" (1/1) ... [2022-04-14 19:26:40,355 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:26:40" (1/1) ... [2022-04-14 19:26:40,359 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:26:40" (1/1) ... [2022-04-14 19:26:40,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:26:40" (1/1) ... [2022-04-14 19:26:40,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:26:40" (1/1) ... [2022-04-14 19:26:40,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 19:26:40,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 19:26:40,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 19:26:40,363 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 19:26:40,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:26:40" (1/1) ... [2022-04-14 19:26:40,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 19:26:40,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 19:26:40,412 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-14 19:26:40,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-14 19:26:40,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 19:26:40,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 19:26:40,439 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 19:26:40,439 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 19:26:40,439 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 19:26:40,439 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 19:26:40,439 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 19:26:40,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 19:26:40,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 19:26:40,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 19:26:40,440 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 19:26:40,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 19:26:40,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 19:26:40,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 19:26:40,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 19:26:40,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 19:26:40,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 19:26:40,485 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 19:26:40,486 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 19:26:49,331 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 19:26:49,341 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 19:26:49,341 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-14 19:26:49,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 07:26:49 BoogieIcfgContainer [2022-04-14 19:26:49,342 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 19:26:49,343 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 19:26:49,343 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 19:26:49,344 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 19:26:49,346 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 07:26:49" (1/1) ... [2022-04-14 19:26:49,347 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 19:26:49,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 07:26:49 BasicIcfg [2022-04-14 19:26:49,363 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 19:26:49,364 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 19:26:49,364 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 19:26:49,366 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 19:26:49,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 07:26:40" (1/4) ... [2022-04-14 19:26:49,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56439ba2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 07:26:49, skipping insertion in model container [2022-04-14 19:26:49,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:26:40" (2/4) ... [2022-04-14 19:26:49,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56439ba2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 07:26:49, skipping insertion in model container [2022-04-14 19:26:49,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 07:26:49" (3/4) ... [2022-04-14 19:26:49,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56439ba2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 07:26:49, skipping insertion in model container [2022-04-14 19:26:49,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 07:26:49" (4/4) ... [2022-04-14 19:26:49,368 INFO L111 eAbstractionObserver]: Analyzing ICFG mod3.c.v+lhb-reducer.cJordan [2022-04-14 19:26:49,371 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 19:26:49,371 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 19:26:49,397 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 19:26:49,401 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-14 19:26:49,401 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 19:26:49,411 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-14 19:26:49,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-14 19:26:49,415 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:26:49,415 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:26:49,416 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:26:49,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:26:49,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1219544613, now seen corresponding path program 1 times [2022-04-14 19:26:49,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:26:49,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80899447] [2022-04-14 19:26:49,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:26:49,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:26:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:26:49,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:26:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:26:49,909 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= v_~__tmp_94_0~0_4 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) (= v_~__tmp_91_0~0_4 0) (= v_~__tmp_88_0~0_4 0) (= (select |v_#valid_1| 1) 1) (= v_~__tmp_112_0~0_4 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~__return_121~0_2 0) (= v_~__tmp_88_1~0_4 0) (= v_~__tmp_93_0~0_4 0) (= v_~__tmp_91_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_88_0~0=v_~__tmp_88_0~0_4, ~__tmp_93_0~0=v_~__tmp_93_0~0_4, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_88_1~0=v_~__tmp_88_1~0_4, ~__tmp_91_0~0=v_~__tmp_91_0~0_4, #NULL.base=|v_#NULL.base_1|, ~__tmp_94_0~0=v_~__tmp_94_0~0_4, ~__tmp_91_1~0=v_~__tmp_91_1~0_4, ~__tmp_112_0~0=v_~__tmp_112_0~0_4, ~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_121~0=v_~__return_121~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__tmp_94_0~0, ~__tmp_91_1~0, ~__tmp_88_0~0, ~__tmp_112_0~0, ~__return_main~0, ~__tmp_93_0~0, ~__return_121~0, #NULL.offset, ~__tmp_88_1~0, ~__tmp_91_0~0, #NULL.base] {31#true} is VALID [2022-04-14 19:26:49,909 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-14 19:26:49,909 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-14 19:26:49,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 19:26:49,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= v_~__tmp_94_0~0_4 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) (= v_~__tmp_91_0~0_4 0) (= v_~__tmp_88_0~0_4 0) (= (select |v_#valid_1| 1) 1) (= v_~__tmp_112_0~0_4 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~__return_121~0_2 0) (= v_~__tmp_88_1~0_4 0) (= v_~__tmp_93_0~0_4 0) (= v_~__tmp_91_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_88_0~0=v_~__tmp_88_0~0_4, ~__tmp_93_0~0=v_~__tmp_93_0~0_4, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_88_1~0=v_~__tmp_88_1~0_4, ~__tmp_91_0~0=v_~__tmp_91_0~0_4, #NULL.base=|v_#NULL.base_1|, ~__tmp_94_0~0=v_~__tmp_94_0~0_4, ~__tmp_91_1~0=v_~__tmp_91_1~0_4, ~__tmp_112_0~0=v_~__tmp_112_0~0_4, ~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_121~0=v_~__return_121~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__tmp_94_0~0, ~__tmp_91_1~0, ~__tmp_88_0~0, ~__tmp_112_0~0, ~__return_main~0, ~__tmp_93_0~0, ~__return_121~0, #NULL.offset, ~__tmp_88_1~0, ~__tmp_91_0~0, #NULL.base] {31#true} is VALID [2022-04-14 19:26:49,912 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-14 19:26:49,912 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-14 19:26:49,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-14 19:26:49,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#true} [79] mainENTRY-->L83: 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-14 19:26:49,914 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] L83-->L23: 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-14 19:26:49,914 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] L23-->L25: 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-14 19:26:52,036 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] L25-->L44: Formula: (and (= 0 v_main_~main__y~0_2) (= (+ 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) (= v_main_~main____CPAchecker_TMP_0~0_6 v_~__tmp_112_0~0_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_112_0~0=v_~__tmp_112_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_112_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-14 19:26:52,041 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] L44-->L56: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_7 v_~__tmp_94_0~0_1) (= v_main_~main____CPAchecker_TMP_0~0_7 v_~__tmp_112_0~0_2)) InVars {~__tmp_112_0~0=v_~__tmp_112_0~0_2} OutVars{~__tmp_94_0~0=v_~__tmp_94_0~0_1, ~__tmp_112_0~0=v_~__tmp_112_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7} AuxVars[] AssignedVars[~__tmp_94_0~0, 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-14 19:26:52,067 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] L56-->L37: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet6_2|) (= v_main_~main____CPAchecker_TMP_0~0_8 v_~__tmp_94_0~0_2) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {~__tmp_94_0~0=v_~__tmp_94_0~0_2, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{~__tmp_94_0~0=v_~__tmp_94_0~0_2, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_0~1, 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-14 19:26:52,069 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] L37-->L90: Formula: (= v_main_~main____CPAchecker_TMP_0~1_11 0) InVars {main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_11} OutVars{main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_11} 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-14 19:26:52,075 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] L90-->L97: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= (mod v_main_~main__y~0_7 4294967296) 0) (= (ite (= (mod (mod (mod v_main_~main__x~0_14 4294967296) 3) 4294967296) 0) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__x~0=v_main_~main__x~0_14, main_~main__y~0=v_main_~main__y~0_7} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__x~0=v_main_~main__x~0_14, main_~main__y~0=v_main_~main__y~0_7, 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-14 19:26:52,075 INFO L290 TraceCheckUtils]: 13: Hoare triple {38#(not (= main_~__VERIFIER_assert__cond~0 0))} [104] L97-->L99: 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-14 19:26:52,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} [108] L99-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#false} is VALID [2022-04-14 19:26:52,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 19:26:52,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:26:52,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80899447] [2022-04-14 19:26:52,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80899447] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:26:52,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 19:26:52,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 19:26:52,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206647933] [2022-04-14 19:26:52,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:26:52,099 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-14 19:26:52,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:26:52,101 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-14 19:26:54,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 14 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 19:26:54,313 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 19:26:54,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:26:54,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 19:26:54,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 19:26:54,332 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-14 19:26:56,525 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:26:58,672 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:27:00,858 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:27:02,993 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-14 19:27:05,162 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-14 19:27:14,034 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:27:16,196 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-14 19:27:18,338 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-14 19:27:22,661 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:27:24,833 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-14 19:27:31,389 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:27:35,724 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:27:37,891 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-14 19:27:40,064 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:27:42,260 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:27:46,610 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:27:48,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:27:48,900 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2022-04-14 19:27:48,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 19:27:48,901 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-14 19:27:48,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:27:48,902 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-14 19:27:48,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-14 19:27:48,907 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-14 19:27:48,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-14 19:27:48,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 68 transitions. [2022-04-14 19:27:51,118 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-14 19:27:51,125 INFO L225 Difference]: With dead ends: 49 [2022-04-14 19:27:51,125 INFO L226 Difference]: Without dead ends: 35 [2022-04-14 19:27:51,126 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-14 19:27:51,128 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 21 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.3s IncrementalHoareTripleChecker+Time [2022-04-14 19:27:51,129 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 95 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 16 Unknown, 0 Unchecked, 34.3s Time] [2022-04-14 19:27:51,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-14 19:27:51,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-04-14 19:27:51,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:27:51,179 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-14 19:27:51,180 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-14 19:27:51,181 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-14 19:27:51,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:27:51,192 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-04-14 19:27:51,192 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-04-14 19:27:51,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:27:51,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:27:51,195 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-14 19:27:51,196 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-14 19:27:51,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:27:51,200 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-04-14 19:27:51,200 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-04-14 19:27:51,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:27:51,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:27:51,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:27:51,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:27:51,200 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-14 19:27:51,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2022-04-14 19:27:51,202 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 15 [2022-04-14 19:27:51,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:27:51,202 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2022-04-14 19:27:51,203 INFO L479 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-14 19:27:51,203 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-04-14 19:27:51,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-14 19:27:51,203 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:27:51,203 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:27:51,203 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 19:27:51,203 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:27:51,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:27:51,204 INFO L85 PathProgramCache]: Analyzing trace with hash -791971888, now seen corresponding path program 1 times [2022-04-14 19:27:51,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:27:51,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41757294] [2022-04-14 19:27:51,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:27:51,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:27:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:27:51,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:27:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:27:51,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {205#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= v_~__tmp_94_0~0_4 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) (= v_~__tmp_91_0~0_4 0) (= v_~__tmp_88_0~0_4 0) (= (select |v_#valid_1| 1) 1) (= v_~__tmp_112_0~0_4 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~__return_121~0_2 0) (= v_~__tmp_88_1~0_4 0) (= v_~__tmp_93_0~0_4 0) (= v_~__tmp_91_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_88_0~0=v_~__tmp_88_0~0_4, ~__tmp_93_0~0=v_~__tmp_93_0~0_4, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_88_1~0=v_~__tmp_88_1~0_4, ~__tmp_91_0~0=v_~__tmp_91_0~0_4, #NULL.base=|v_#NULL.base_1|, ~__tmp_94_0~0=v_~__tmp_94_0~0_4, ~__tmp_91_1~0=v_~__tmp_91_1~0_4, ~__tmp_112_0~0=v_~__tmp_112_0~0_4, ~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_121~0=v_~__return_121~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__tmp_94_0~0, ~__tmp_91_1~0, ~__tmp_88_0~0, ~__tmp_112_0~0, ~__return_main~0, ~__tmp_93_0~0, ~__return_121~0, #NULL.offset, ~__tmp_88_1~0, ~__tmp_91_0~0, #NULL.base] {197#true} is VALID [2022-04-14 19:27:51,468 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-14 19:27:51,468 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-14 19:27:51,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {197#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {205#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 19:27:51,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {205#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= v_~__tmp_94_0~0_4 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) (= v_~__tmp_91_0~0_4 0) (= v_~__tmp_88_0~0_4 0) (= (select |v_#valid_1| 1) 1) (= v_~__tmp_112_0~0_4 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~__return_121~0_2 0) (= v_~__tmp_88_1~0_4 0) (= v_~__tmp_93_0~0_4 0) (= v_~__tmp_91_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_88_0~0=v_~__tmp_88_0~0_4, ~__tmp_93_0~0=v_~__tmp_93_0~0_4, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_88_1~0=v_~__tmp_88_1~0_4, ~__tmp_91_0~0=v_~__tmp_91_0~0_4, #NULL.base=|v_#NULL.base_1|, ~__tmp_94_0~0=v_~__tmp_94_0~0_4, ~__tmp_91_1~0=v_~__tmp_91_1~0_4, ~__tmp_112_0~0=v_~__tmp_112_0~0_4, ~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_121~0=v_~__return_121~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__tmp_94_0~0, ~__tmp_91_1~0, ~__tmp_88_0~0, ~__tmp_112_0~0, ~__return_main~0, ~__tmp_93_0~0, ~__return_121~0, #NULL.offset, ~__tmp_88_1~0, ~__tmp_91_0~0, #NULL.base] {197#true} is VALID [2022-04-14 19:27:51,469 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-14 19:27:51,470 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-14 19:27:51,470 INFO L272 TraceCheckUtils]: 4: Hoare triple {197#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#true} is VALID [2022-04-14 19:27:51,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {197#true} [79] mainENTRY-->L83: 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-14 19:27:51,471 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] L83-->L23: 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-14 19:27:51,472 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] L23-->L25: 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-14 19:27:51,472 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] L25-->L117: Formula: (not (= (mod (mod (mod v_main_~main__x~0_15 4294967296) 3) 4294967296) 1)) InVars {main_~main__x~0=v_main_~main__x~0_15} OutVars{main_~main__x~0=v_main_~main__x~0_15} 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-14 19:27:53,612 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] L117-->L122: Formula: (and (= 0 v_main_~main__y~0_9) (= (mod (mod (mod v_main_~main__x~0_17 4294967296) 3) 4294967296) 2) (= v_main_~main____CPAchecker_TMP_0~0_9 v_~__tmp_93_0~0_3) (= (+ v_main_~main__x~0_17 1) v_main_~main__x~0_16)) InVars {main_~main__x~0=v_main_~main__x~0_17, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_9} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_9, main_~main__x~0=v_main_~main__x~0_16, ~__tmp_93_0~0=v_~__tmp_93_0~0_3, main_~main__y~0=v_main_~main__y~0_9} AuxVars[] AssignedVars[~__tmp_93_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-14 19:27:53,614 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] L122-->L56: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_6 v_~__tmp_93_0~0_2) (= v_main_~main____CPAchecker_TMP_0~1_6 v_~__tmp_94_0~0_3)) InVars {~__tmp_93_0~0=v_~__tmp_93_0~0_2} OutVars{~__tmp_94_0~0=v_~__tmp_94_0~0_3, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_6, ~__tmp_93_0~0=v_~__tmp_93_0~0_2} AuxVars[] AssignedVars[~__tmp_94_0~0, 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-14 19:27:53,614 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] L56-->L37: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet6_2|) (= v_main_~main____CPAchecker_TMP_0~0_8 v_~__tmp_94_0~0_2) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {~__tmp_94_0~0=v_~__tmp_94_0~0_2, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{~__tmp_94_0~0=v_~__tmp_94_0~0_2, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_0~1, 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-14 19:27:53,615 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] L37-->L90: Formula: (= v_main_~main____CPAchecker_TMP_0~1_11 0) InVars {main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_11} OutVars{main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_11} 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-14 19:27:53,622 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] L90-->L97: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= (mod v_main_~main__y~0_7 4294967296) 0) (= (ite (= (mod (mod (mod v_main_~main__x~0_14 4294967296) 3) 4294967296) 0) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__x~0=v_main_~main__x~0_14, main_~main__y~0=v_main_~main__y~0_7} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__x~0=v_main_~main__x~0_14, main_~main__y~0=v_main_~main__y~0_7, 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-14 19:27:53,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {204#(not (= main_~__VERIFIER_assert__cond~0 0))} [104] L97-->L99: 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-14 19:27:53,623 INFO L290 TraceCheckUtils]: 15: Hoare triple {198#false} [108] L99-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {198#false} is VALID [2022-04-14 19:27:53,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 19:27:53,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:27:53,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41757294] [2022-04-14 19:27:53,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41757294] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:27:53,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 19:27:53,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 19:27:53,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767507896] [2022-04-14 19:27:53,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:27:53,625 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-14 19:27:53,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:27:53,625 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-14 19:27:55,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 15 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 19:27:55,814 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 19:27:55,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:27:55,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 19:27:55,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 19:27:55,815 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-14 19:27:57,951 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:28:06,659 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:28:08,870 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:28:15,626 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:28:20,240 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:28:24,590 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:28:28,940 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:28:31,113 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-14 19:28:33,282 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-14 19:28:37,606 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:28:41,941 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:28:46,280 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:28:48,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:28:48,620 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-04-14 19:28:48,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 19:28:48,620 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-14 19:28:48,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:28:48,620 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-14 19:28:48,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-14 19:28:48,622 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-14 19:28:48,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-14 19:28:48,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 50 transitions. [2022-04-14 19:28:50,841 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-14 19:28:50,842 INFO L225 Difference]: With dead ends: 42 [2022-04-14 19:28:50,842 INFO L226 Difference]: Without dead ends: 40 [2022-04-14 19:28:50,843 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-14 19:28:50,843 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 16 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.1s IncrementalHoareTripleChecker+Time [2022-04-14 19:28:50,844 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 79 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 12 Unknown, 0 Unchecked, 25.1s Time] [2022-04-14 19:28:50,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-14 19:28:50,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2022-04-14 19:28:50,846 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:28:50,846 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-14 19:28:50,846 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-14 19:28:50,846 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-14 19:28:50,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:28:50,848 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-14 19:28:50,848 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-14 19:28:50,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:28:50,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:28:50,849 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-14 19:28:50,850 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-14 19:28:50,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:28:50,851 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-14 19:28:50,851 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-14 19:28:50,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:28:50,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:28:50,852 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:28:50,852 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:28:50,852 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-14 19:28:50,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-04-14 19:28:50,853 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 16 [2022-04-14 19:28:50,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:28:50,853 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-04-14 19:28:50,853 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-14 19:28:50,854 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-04-14 19:28:50,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-14 19:28:50,854 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:28:50,854 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:28:50,854 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 19:28:50,854 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:28:50,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:28:50,855 INFO L85 PathProgramCache]: Analyzing trace with hash 364986418, now seen corresponding path program 1 times [2022-04-14 19:28:50,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:28:50,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076350879] [2022-04-14 19:28:50,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:28:50,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:28:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:28:50,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:28:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:28:51,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {377#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= v_~__tmp_94_0~0_4 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) (= v_~__tmp_91_0~0_4 0) (= v_~__tmp_88_0~0_4 0) (= (select |v_#valid_1| 1) 1) (= v_~__tmp_112_0~0_4 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~__return_121~0_2 0) (= v_~__tmp_88_1~0_4 0) (= v_~__tmp_93_0~0_4 0) (= v_~__tmp_91_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_88_0~0=v_~__tmp_88_0~0_4, ~__tmp_93_0~0=v_~__tmp_93_0~0_4, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_88_1~0=v_~__tmp_88_1~0_4, ~__tmp_91_0~0=v_~__tmp_91_0~0_4, #NULL.base=|v_#NULL.base_1|, ~__tmp_94_0~0=v_~__tmp_94_0~0_4, ~__tmp_91_1~0=v_~__tmp_91_1~0_4, ~__tmp_112_0~0=v_~__tmp_112_0~0_4, ~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_121~0=v_~__return_121~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__tmp_94_0~0, ~__tmp_91_1~0, ~__tmp_88_0~0, ~__tmp_112_0~0, ~__return_main~0, ~__tmp_93_0~0, ~__return_121~0, #NULL.offset, ~__tmp_88_1~0, ~__tmp_91_0~0, #NULL.base] {370#true} is VALID [2022-04-14 19:28:51,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {370#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {370#true} is VALID [2022-04-14 19:28:51,003 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {370#true} {370#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {370#true} is VALID [2022-04-14 19:28:51,004 INFO L272 TraceCheckUtils]: 0: Hoare triple {370#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {377#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 19:28:51,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {377#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= v_~__tmp_94_0~0_4 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) (= v_~__tmp_91_0~0_4 0) (= v_~__tmp_88_0~0_4 0) (= (select |v_#valid_1| 1) 1) (= v_~__tmp_112_0~0_4 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~__return_121~0_2 0) (= v_~__tmp_88_1~0_4 0) (= v_~__tmp_93_0~0_4 0) (= v_~__tmp_91_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_88_0~0=v_~__tmp_88_0~0_4, ~__tmp_93_0~0=v_~__tmp_93_0~0_4, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_88_1~0=v_~__tmp_88_1~0_4, ~__tmp_91_0~0=v_~__tmp_91_0~0_4, #NULL.base=|v_#NULL.base_1|, ~__tmp_94_0~0=v_~__tmp_94_0~0_4, ~__tmp_91_1~0=v_~__tmp_91_1~0_4, ~__tmp_112_0~0=v_~__tmp_112_0~0_4, ~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_121~0=v_~__return_121~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__tmp_94_0~0, ~__tmp_91_1~0, ~__tmp_88_0~0, ~__tmp_112_0~0, ~__return_main~0, ~__tmp_93_0~0, ~__return_121~0, #NULL.offset, ~__tmp_88_1~0, ~__tmp_91_0~0, #NULL.base] {370#true} is VALID [2022-04-14 19:28:51,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {370#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {370#true} is VALID [2022-04-14 19:28:51,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {370#true} {370#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {370#true} is VALID [2022-04-14 19:28:51,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {370#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {370#true} is VALID [2022-04-14 19:28:51,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {370#true} [79] mainENTRY-->L83: 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] {370#true} is VALID [2022-04-14 19:28:51,005 INFO L290 TraceCheckUtils]: 6: Hoare triple {370#true} [81] L83-->L23: 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] {370#true} is VALID [2022-04-14 19:28:51,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {370#true} [82] L23-->L25: 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[] {370#true} is VALID [2022-04-14 19:28:51,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {370#true} [85] L25-->L117: Formula: (not (= (mod (mod (mod v_main_~main__x~0_15 4294967296) 3) 4294967296) 1)) InVars {main_~main__x~0=v_main_~main__x~0_15} OutVars{main_~main__x~0=v_main_~main__x~0_15} AuxVars[] AssignedVars[] {370#true} is VALID [2022-04-14 19:28:51,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {370#true} [89] L117-->L128: 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] {370#true} is VALID [2022-04-14 19:28:51,005 INFO L290 TraceCheckUtils]: 10: Hoare triple {370#true} [92] L128-->L134: 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_88_1~0_3) (= v_~__tmp_88_0~0_3 v_main_~main____CPAchecker_TMP_0~0_10) (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{~__tmp_88_0~0=v_~__tmp_88_0~0_3, 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, ~__tmp_88_1~0=v_~__tmp_88_1~0_3, main_~main__x~0=v_main_~main__x~0_19, main_~main__y~0=v_main_~main__y~0_10} AuxVars[] AssignedVars[~__tmp_88_0~0, ~__tmp_88_1~0, main_~main__x~0, main_~main__y~0] {370#true} is VALID [2022-04-14 19:28:51,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {370#true} [96] L134-->L83: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_4 v_~__tmp_88_1~0_2) (= v_main_~main____CPAchecker_TMP_0~1_8 v_~__tmp_88_0~0_2)) InVars {~__tmp_88_1~0=v_~__tmp_88_1~0_2, ~__tmp_88_0~0=v_~__tmp_88_0~0_2} OutVars{~__tmp_88_0~0=v_~__tmp_88_0~0_2, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_8, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, ~__tmp_88_1~0=v_~__tmp_88_1~0_2} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_~main____CPAchecker_TMP_1~0] {370#true} is VALID [2022-04-14 19:28:51,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {370#true} [81] L83-->L23: 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] {370#true} is VALID [2022-04-14 19:28:51,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {370#true} [82] L23-->L25: 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[] {370#true} is VALID [2022-04-14 19:28:53,123 WARN L290 TraceCheckUtils]: 14: Hoare triple {370#true} [84] L25-->L44: Formula: (and (= 0 v_main_~main__y~0_2) (= (+ 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) (= v_main_~main____CPAchecker_TMP_0~0_6 v_~__tmp_112_0~0_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_112_0~0=v_~__tmp_112_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_112_0~0, main_~main__x~0, main_~main__y~0] {375#(<= 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-14 19:28:53,124 INFO L290 TraceCheckUtils]: 15: Hoare triple {375#(<= 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] L44-->L56: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_7 v_~__tmp_94_0~0_1) (= v_main_~main____CPAchecker_TMP_0~0_7 v_~__tmp_112_0~0_2)) InVars {~__tmp_112_0~0=v_~__tmp_112_0~0_2} OutVars{~__tmp_94_0~0=v_~__tmp_94_0~0_1, ~__tmp_112_0~0=v_~__tmp_112_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7} AuxVars[] AssignedVars[~__tmp_94_0~0, main_~main____CPAchecker_TMP_0~0] {375#(<= 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-14 19:28:53,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {375#(<= 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] L56-->L37: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet6_2|) (= v_main_~main____CPAchecker_TMP_0~0_8 v_~__tmp_94_0~0_2) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {~__tmp_94_0~0=v_~__tmp_94_0~0_2, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{~__tmp_94_0~0=v_~__tmp_94_0~0_2, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_0~1, main_~main____CPAchecker_TMP_0~0] {375#(<= 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-14 19:28:53,125 INFO L290 TraceCheckUtils]: 17: Hoare triple {375#(<= 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] L37-->L90: Formula: (= v_main_~main____CPAchecker_TMP_0~1_11 0) InVars {main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_11} OutVars{main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_11} AuxVars[] AssignedVars[] {375#(<= 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-14 19:28:53,132 INFO L290 TraceCheckUtils]: 18: Hoare triple {375#(<= 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] L90-->L97: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= (mod v_main_~main__y~0_7 4294967296) 0) (= (ite (= (mod (mod (mod v_main_~main__x~0_14 4294967296) 3) 4294967296) 0) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__x~0=v_main_~main__x~0_14, main_~main__y~0=v_main_~main__y~0_7} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__x~0=v_main_~main__x~0_14, main_~main__y~0=v_main_~main__y~0_7, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {376#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-14 19:28:53,133 INFO L290 TraceCheckUtils]: 19: Hoare triple {376#(not (= main_~__VERIFIER_assert__cond~0 0))} [104] L97-->L99: 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[] {371#false} is VALID [2022-04-14 19:28:53,133 INFO L290 TraceCheckUtils]: 20: Hoare triple {371#false} [108] L99-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {371#false} is VALID [2022-04-14 19:28:53,133 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-14 19:28:53,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:28:53,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076350879] [2022-04-14 19:28:53,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076350879] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:28:53,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 19:28:53,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 19:28:53,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963589188] [2022-04-14 19:28:53,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:28:53,134 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-14 19:28:53,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:28:53,134 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-14 19:28:55,327 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-14 19:28:55,328 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 19:28:55,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:28:55,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 19:28:55,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 19:28:55,329 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-14 19:28:59,550 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-14 19:29:04,031 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:29:08,240 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-14 19:29:10,416 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:29:12,598 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:29:21,476 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-14 19:29:23,652 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-14 19:29:25,777 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:29:27,953 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:29:34,486 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-14 19:29:36,663 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:29:36,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:29:36,845 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-04-14 19:29:36,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 19:29:36,845 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-14 19:29:36,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:29:36,846 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-14 19:29:36,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-14 19:29:36,847 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-14 19:29:36,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-14 19:29:36,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-14 19:29:41,253 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-14 19:29:41,257 INFO L225 Difference]: With dead ends: 47 [2022-04-14 19:29:41,257 INFO L226 Difference]: Without dead ends: 45 [2022-04-14 19:29:41,257 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-14 19:29:41,258 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.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, 50 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.3s IncrementalHoareTripleChecker+Time [2022-04-14 19:29:41,258 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 56 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 10 Unknown, 0 Unchecked, 23.3s Time] [2022-04-14 19:29:41,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-14 19:29:41,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2022-04-14 19:29:41,260 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:29:41,260 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-14 19:29:41,260 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-14 19:29:41,261 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-14 19:29:41,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:29:41,262 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-04-14 19:29:41,262 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-04-14 19:29:41,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:29:41,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:29:41,263 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-14 19:29:41,263 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-14 19:29:41,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:29:41,264 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-04-14 19:29:41,264 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-04-14 19:29:41,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:29:41,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:29:41,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:29:41,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:29:41,265 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-14 19:29:41,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-04-14 19:29:41,266 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 21 [2022-04-14 19:29:41,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:29:41,266 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-04-14 19:29:41,266 INFO L479 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-14 19:29:41,266 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-04-14 19:29:41,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 19:29:41,266 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:29:41,266 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:29:41,267 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-14 19:29:41,267 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:29:41,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:29:41,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1083849817, now seen corresponding path program 1 times [2022-04-14 19:29:41,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:29:41,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489557700] [2022-04-14 19:29:41,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:29:41,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:29:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:29:41,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:29:41,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:29:41,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {560#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= v_~__tmp_94_0~0_4 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) (= v_~__tmp_91_0~0_4 0) (= v_~__tmp_88_0~0_4 0) (= (select |v_#valid_1| 1) 1) (= v_~__tmp_112_0~0_4 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~__return_121~0_2 0) (= v_~__tmp_88_1~0_4 0) (= v_~__tmp_93_0~0_4 0) (= v_~__tmp_91_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_88_0~0=v_~__tmp_88_0~0_4, ~__tmp_93_0~0=v_~__tmp_93_0~0_4, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_88_1~0=v_~__tmp_88_1~0_4, ~__tmp_91_0~0=v_~__tmp_91_0~0_4, #NULL.base=|v_#NULL.base_1|, ~__tmp_94_0~0=v_~__tmp_94_0~0_4, ~__tmp_91_1~0=v_~__tmp_91_1~0_4, ~__tmp_112_0~0=v_~__tmp_112_0~0_4, ~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_121~0=v_~__return_121~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__tmp_94_0~0, ~__tmp_91_1~0, ~__tmp_88_0~0, ~__tmp_112_0~0, ~__return_main~0, ~__tmp_93_0~0, ~__return_121~0, #NULL.offset, ~__tmp_88_1~0, ~__tmp_91_0~0, #NULL.base] {553#true} is VALID [2022-04-14 19:29:41,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {553#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {553#true} is VALID [2022-04-14 19:29:41,488 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {553#true} {553#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {553#true} is VALID [2022-04-14 19:29:41,489 INFO L272 TraceCheckUtils]: 0: Hoare triple {553#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {560#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 19:29:41,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {560#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= v_~__tmp_94_0~0_4 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) (= v_~__tmp_91_0~0_4 0) (= v_~__tmp_88_0~0_4 0) (= (select |v_#valid_1| 1) 1) (= v_~__tmp_112_0~0_4 0) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~__return_121~0_2 0) (= v_~__tmp_88_1~0_4 0) (= v_~__tmp_93_0~0_4 0) (= v_~__tmp_91_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_88_0~0=v_~__tmp_88_0~0_4, ~__tmp_93_0~0=v_~__tmp_93_0~0_4, #NULL.offset=|v_#NULL.offset_1|, ~__tmp_88_1~0=v_~__tmp_88_1~0_4, ~__tmp_91_0~0=v_~__tmp_91_0~0_4, #NULL.base=|v_#NULL.base_1|, ~__tmp_94_0~0=v_~__tmp_94_0~0_4, ~__tmp_91_1~0=v_~__tmp_91_1~0_4, ~__tmp_112_0~0=v_~__tmp_112_0~0_4, ~__return_main~0=v_~__return_main~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_121~0=v_~__return_121~0_2, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|} AuxVars[] AssignedVars[~__tmp_94_0~0, ~__tmp_91_1~0, ~__tmp_88_0~0, ~__tmp_112_0~0, ~__return_main~0, ~__tmp_93_0~0, ~__return_121~0, #NULL.offset, ~__tmp_88_1~0, ~__tmp_91_0~0, #NULL.base] {553#true} is VALID [2022-04-14 19:29:41,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {553#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {553#true} is VALID [2022-04-14 19:29:41,490 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {553#true} {553#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {553#true} is VALID [2022-04-14 19:29:41,490 INFO L272 TraceCheckUtils]: 4: Hoare triple {553#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {553#true} is VALID [2022-04-14 19:29:41,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {553#true} [79] mainENTRY-->L83: 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] {553#true} is VALID [2022-04-14 19:29:41,490 INFO L290 TraceCheckUtils]: 6: Hoare triple {553#true} [81] L83-->L23: 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] {553#true} is VALID [2022-04-14 19:29:41,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {553#true} [82] L23-->L25: 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[] {553#true} is VALID [2022-04-14 19:29:41,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {553#true} [85] L25-->L117: Formula: (not (= (mod (mod (mod v_main_~main__x~0_15 4294967296) 3) 4294967296) 1)) InVars {main_~main__x~0=v_main_~main__x~0_15} OutVars{main_~main__x~0=v_main_~main__x~0_15} AuxVars[] AssignedVars[] {553#true} is VALID [2022-04-14 19:29:41,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {553#true} [89] L117-->L128: 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] {553#true} is VALID [2022-04-14 19:29:41,490 INFO L290 TraceCheckUtils]: 10: Hoare triple {553#true} [92] L128-->L134: 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_88_1~0_3) (= v_~__tmp_88_0~0_3 v_main_~main____CPAchecker_TMP_0~0_10) (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{~__tmp_88_0~0=v_~__tmp_88_0~0_3, 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, ~__tmp_88_1~0=v_~__tmp_88_1~0_3, main_~main__x~0=v_main_~main__x~0_19, main_~main__y~0=v_main_~main__y~0_10} AuxVars[] AssignedVars[~__tmp_88_0~0, ~__tmp_88_1~0, main_~main__x~0, main_~main__y~0] {553#true} is VALID [2022-04-14 19:29:41,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {553#true} [96] L134-->L83: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_4 v_~__tmp_88_1~0_2) (= v_main_~main____CPAchecker_TMP_0~1_8 v_~__tmp_88_0~0_2)) InVars {~__tmp_88_1~0=v_~__tmp_88_1~0_2, ~__tmp_88_0~0=v_~__tmp_88_0~0_2} OutVars{~__tmp_88_0~0=v_~__tmp_88_0~0_2, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_8, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, ~__tmp_88_1~0=v_~__tmp_88_1~0_2} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_~main____CPAchecker_TMP_1~0] {553#true} is VALID [2022-04-14 19:29:41,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {553#true} [81] L83-->L23: 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] {553#true} is VALID [2022-04-14 19:29:41,491 INFO L290 TraceCheckUtils]: 13: Hoare triple {553#true} [82] L23-->L25: 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[] {553#true} is VALID [2022-04-14 19:29:41,491 INFO L290 TraceCheckUtils]: 14: Hoare triple {553#true} [85] L25-->L117: Formula: (not (= (mod (mod (mod v_main_~main__x~0_15 4294967296) 3) 4294967296) 1)) InVars {main_~main__x~0=v_main_~main__x~0_15} OutVars{main_~main__x~0=v_main_~main__x~0_15} AuxVars[] AssignedVars[] {553#true} is VALID [2022-04-14 19:29:43,656 WARN L290 TraceCheckUtils]: 15: Hoare triple {553#true} [88] L117-->L122: Formula: (and (= 0 v_main_~main__y~0_9) (= (mod (mod (mod v_main_~main__x~0_17 4294967296) 3) 4294967296) 2) (= v_main_~main____CPAchecker_TMP_0~0_9 v_~__tmp_93_0~0_3) (= (+ v_main_~main__x~0_17 1) v_main_~main__x~0_16)) InVars {main_~main__x~0=v_main_~main__x~0_17, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_9} OutVars{main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_9, main_~main__x~0=v_main_~main__x~0_16, ~__tmp_93_0~0=v_~__tmp_93_0~0_3, main_~main__y~0=v_main_~main__y~0_9} AuxVars[] AssignedVars[~__tmp_93_0~0, main_~main__x~0, main_~main__y~0] {558#(<= 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-14 19:29:43,657 INFO L290 TraceCheckUtils]: 16: Hoare triple {558#(<= 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] L122-->L56: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_6 v_~__tmp_93_0~0_2) (= v_main_~main____CPAchecker_TMP_0~1_6 v_~__tmp_94_0~0_3)) InVars {~__tmp_93_0~0=v_~__tmp_93_0~0_2} OutVars{~__tmp_94_0~0=v_~__tmp_94_0~0_3, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_6, ~__tmp_93_0~0=v_~__tmp_93_0~0_2} AuxVars[] AssignedVars[~__tmp_94_0~0, main_~main____CPAchecker_TMP_0~1] {558#(<= 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-14 19:29:43,658 INFO L290 TraceCheckUtils]: 17: Hoare triple {558#(<= 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] L56-->L37: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet6_2|) (= v_main_~main____CPAchecker_TMP_0~0_8 v_~__tmp_94_0~0_2) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {~__tmp_94_0~0=v_~__tmp_94_0~0_2, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{~__tmp_94_0~0=v_~__tmp_94_0~0_2, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_0~1, main_~main____CPAchecker_TMP_0~0] {558#(<= 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-14 19:29:43,659 INFO L290 TraceCheckUtils]: 18: Hoare triple {558#(<= 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] L37-->L90: Formula: (= v_main_~main____CPAchecker_TMP_0~1_11 0) InVars {main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_11} OutVars{main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_11} AuxVars[] AssignedVars[] {558#(<= 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-14 19:29:43,666 INFO L290 TraceCheckUtils]: 19: Hoare triple {558#(<= 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] L90-->L97: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= (mod v_main_~main__y~0_7 4294967296) 0) (= (ite (= (mod (mod (mod v_main_~main__x~0_14 4294967296) 3) 4294967296) 0) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__x~0=v_main_~main__x~0_14, main_~main__y~0=v_main_~main__y~0_7} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__x~0=v_main_~main__x~0_14, main_~main__y~0=v_main_~main__y~0_7, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {559#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-14 19:29:43,666 INFO L290 TraceCheckUtils]: 20: Hoare triple {559#(not (= main_~__VERIFIER_assert__cond~0 0))} [104] L97-->L99: 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[] {554#false} is VALID [2022-04-14 19:29:43,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {554#false} [108] L99-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#false} is VALID [2022-04-14 19:29:43,667 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-14 19:29:43,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:29:43,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489557700] [2022-04-14 19:29:43,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489557700] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:29:43,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 19:29:43,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 19:29:43,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515543005] [2022-04-14 19:29:43,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:29:43,668 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-14 19:29:43,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:29:43,668 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-14 19:29:45,864 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-14 19:29:45,864 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 19:29:45,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:29:45,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 19:29:45,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 19:29:45,865 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-14 19:29:50,092 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:29:52,260 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-14 19:29:54,373 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:29:58,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-14 19:30:03,010 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:30:05,170 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-14 19:30:07,398 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:30:09,592 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:30:11,762 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-14 19:30:16,128 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:30:18,316 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:30:18,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:30:18,507 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2022-04-14 19:30:18,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 19:30:18,507 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-14 19:30:18,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:30:18,507 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-14 19:30:18,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-14 19:30:18,508 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-14 19:30:18,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-14 19:30:18,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2022-04-14 19:30:22,898 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-14 19:30:22,898 INFO L225 Difference]: With dead ends: 37 [2022-04-14 19:30:22,898 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 19:30:22,898 INFO L912 BasicCegarLoop]: 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-14 19:30:22,899 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.0s IncrementalHoareTripleChecker+Time [2022-04-14 19:30:22,899 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 59 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 11 Unknown, 0 Unchecked, 23.0s Time] [2022-04-14 19:30:22,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 19:30:22,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 19:30:22,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:30:22,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 19:30:22,900 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 19:30:22,900 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 19:30:22,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:30:22,900 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 19:30:22,900 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 19:30:22,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:30:22,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:30:22,900 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-14 19:30:22,900 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-14 19:30:22,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:30:22,901 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 19:30:22,901 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 19:30:22,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:30:22,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:30:22,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:30:22,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:30:22,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 19:30:22,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 19:30:22,902 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-04-14 19:30:22,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:30:22,902 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 19:30:22,902 INFO L479 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-14 19:30:22,902 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 19:30:22,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:30:22,904 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 19:30:22,905 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-14 19:30:22,908 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-04-14 19:30:22,909 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 19:30:22,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 07:30:22 BasicIcfg [2022-04-14 19:30:22,910 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 19:30:22,911 INFO L158 Benchmark]: Toolchain (without parser) took 222834.02ms. Allocated memory was 159.4MB in the beginning and 191.9MB in the end (delta: 32.5MB). Free memory was 108.2MB in the beginning and 146.6MB in the end (delta: -38.4MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 19:30:22,915 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 159.4MB. Free memory was 125.0MB in the beginning and 124.9MB in the end (delta: 78.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 19:30:22,915 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.28ms. Allocated memory is still 159.4MB. Free memory was 108.0MB in the beginning and 134.5MB in the end (delta: -26.5MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. [2022-04-14 19:30:22,916 INFO L158 Benchmark]: Boogie Preprocessor took 25.95ms. Allocated memory is still 159.4MB. Free memory was 134.5MB in the beginning and 133.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-14 19:30:22,916 INFO L158 Benchmark]: RCFGBuilder took 8979.38ms. Allocated memory is still 159.4MB. Free memory was 133.0MB in the beginning and 119.8MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-14 19:30:22,916 INFO L158 Benchmark]: IcfgTransformer took 20.50ms. Allocated memory is still 159.4MB. Free memory was 119.8MB in the beginning and 118.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 19:30:22,917 INFO L158 Benchmark]: TraceAbstraction took 213546.11ms. Allocated memory was 159.4MB in the beginning and 191.9MB in the end (delta: 32.5MB). Free memory was 117.4MB in the beginning and 146.6MB in the end (delta: -29.1MB). Peak memory consumption was 4.8MB. Max. memory is 8.0GB. [2022-04-14 19:30:22,918 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.09ms. Allocated memory is still 159.4MB. Free memory was 125.0MB in the beginning and 124.9MB in the end (delta: 78.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 258.28ms. Allocated memory is still 159.4MB. Free memory was 108.0MB in the beginning and 134.5MB in the end (delta: -26.5MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.95ms. Allocated memory is still 159.4MB. Free memory was 134.5MB in the beginning and 133.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 8979.38ms. Allocated memory is still 159.4MB. Free memory was 133.0MB in the beginning and 119.8MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 20.50ms. Allocated memory is still 159.4MB. Free memory was 119.8MB in the beginning and 118.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 213546.11ms. Allocated memory was 159.4MB in the beginning and 191.9MB in the end (delta: 32.5MB). Free memory was 117.4MB in the beginning and 146.6MB in the end (delta: -29.1MB). Peak memory consumption was 4.8MB. 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: 99]: 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: 213.5s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 194.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 49 mSolverCounterUnknown, 55 SdHoareTripleChecker+Valid, 105.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 55 mSDsluCounter, 289 SdHoareTripleChecker+Invalid, 100.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 185 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 257 IncrementalHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 104 mSDtfsCounter, 257 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=2, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 20 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 1175 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-14 19:30:22,948 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...